/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:18:58,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:18:58,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:18:58,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:18:58,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:18:58,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:18:58,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:18:58,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:18:58,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:18:58,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:18:58,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:18:58,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:18:58,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:18:58,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:18:58,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:18:58,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:18:58,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:18:58,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:18:58,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:18:58,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:18:58,166 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:18:58,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:18:58,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:18:58,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:18:58,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:18:58,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:18:58,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:18:58,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:18:58,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:18:58,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:18:58,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:18:58,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:18:58,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:18:58,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:18:58,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:18:58,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:18:58,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:18:58,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:18:58,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:18:58,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:18:58,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:18:58,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:18:58,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:18:58,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:18:58,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:18:58,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:18:58,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:18:58,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:18:58,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:18:58,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:18:58,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:18:58,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:18:58,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:18:58,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:18:58,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:18:58,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:18:58,191 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 11:18:58,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:18:58,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:18:58,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:18:58,390 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:18:58,390 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:18:58,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c [2022-04-28 11:18:58,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510d91673/03413b3e2e194dfeb885c89111bf2a99/FLAG3585196c1 [2022-04-28 11:18:58,793 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:18:58,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c [2022-04-28 11:18:58,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510d91673/03413b3e2e194dfeb885c89111bf2a99/FLAG3585196c1 [2022-04-28 11:18:58,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510d91673/03413b3e2e194dfeb885c89111bf2a99 [2022-04-28 11:18:58,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:18:58,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:18:58,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:18:58,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:18:58,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:18:58,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:18:58" (1/1) ... [2022-04-28 11:18:58,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6834e4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:58, skipping insertion in model container [2022-04-28 11:18:58,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:18:58" (1/1) ... [2022-04-28 11:18:58,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:18:58,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:18:58,979 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_valuebound50.c[588,601] [2022-04-28 11:18:59,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:18:59,013 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:18:59,027 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_valuebound50.c[588,601] [2022-04-28 11:18:59,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:18:59,055 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:18:59,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59 WrapperNode [2022-04-28 11:18:59,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:18:59,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:18:59,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:18:59,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:18:59,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:18:59,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:18:59,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:18:59,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:18:59,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (1/1) ... [2022-04-28 11:18:59,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:18:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:59,126 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-28 11:18:59,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:18:59,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:18:59,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:18:59,151 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:18:59,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:18:59,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:18:59,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:18:59,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:18:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:18:59,191 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:18:59,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:18:59,322 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:18:59,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:18:59,327 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:18:59,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:18:59 BoogieIcfgContainer [2022-04-28 11:18:59,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:18:59,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:18:59,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:18:59,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:18:59,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:18:58" (1/3) ... [2022-04-28 11:18:59,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e92f915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:18:59, skipping insertion in model container [2022-04-28 11:18:59,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:18:59" (2/3) ... [2022-04-28 11:18:59,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e92f915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:18:59, skipping insertion in model container [2022-04-28 11:18:59,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:18:59" (3/3) ... [2022-04-28 11:18:59,346 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound50.c [2022-04-28 11:18:59,355 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:18:59,355 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:18:59,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:18:59,397 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62d4006a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20573ffa [2022-04-28 11:18:59,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:18:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:18:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:18:59,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:59,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:59,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 11:18:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:59,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932246354] [2022-04-28 11:18:59,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:18:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 11:18:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:59,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833761820] [2022-04-28 11:18:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:18:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:59,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 11:18:59,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:18:59,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:18:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:18:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:59,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:18:59,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:18:59,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:18:59,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:18:59,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:18:59,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 11:18:59,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:18:59,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:18:59,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 11:18:59,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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; {39#true} is VALID [2022-04-28 11:18:59,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {39#true} is VALID [2022-04-28 11:18:59,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:18:59,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:18:59,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:18:59,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:18:59,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-28 11:18:59,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 11:18:59,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-28 11:18:59,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 11:18:59,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 11:18:59,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 11:18:59,551 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-28 11:18:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:59,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833761820] [2022-04-28 11:18:59,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833761820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:59,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:59,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:18:59,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:59,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932246354] [2022-04-28 11:18:59,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932246354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:59,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:59,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:18:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619104825] [2022-04-28 11:18:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:18:59,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:59,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:18:59,593 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-28 11:18:59,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:18:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:18:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:18:59,612 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:18:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:59,791 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 11:18:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:18:59,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:18:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:18:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:18:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:18:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:18:59,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:18:59,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:59,918 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:18:59,918 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 11:18:59,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:18:59,922 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:59,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:18:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 11:18:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 11:18:59,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:59,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:18:59,945 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:18:59,945 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:18:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:59,948 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:18:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:18:59,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:59,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:59,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:18:59,950 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:18:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:59,952 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:18:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:18:59,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:59,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:59,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:59,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:18:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 11:18:59,957 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 11:18:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:59,957 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 11:18:59,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:18:59,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 11:19:00,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:19:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:19:00,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:00,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:00,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:19:00,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 11:19:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:00,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878530425] [2022-04-28 11:19:00,005 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 11:19:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:00,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823507300] [2022-04-28 11:19:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:19:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:00,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-28 11:19:00,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:19:00,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:19:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:19:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:00,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:19:00,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:19:00,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:19:00,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:19:00,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:19:00,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-28 11:19:00,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:19:00,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:19:00,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 11:19:00,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#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; {301#true} is VALID [2022-04-28 11:19:00,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {301#true} is VALID [2022-04-28 11:19:00,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:19:00,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:19:00,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:19:00,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:19:00,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:19:00,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:19:00,104 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:00,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:00,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 11:19:00,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 11:19:00,105 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-28 11:19:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:00,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823507300] [2022-04-28 11:19:00,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823507300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:00,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:00,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:19:00,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:00,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878530425] [2022-04-28 11:19:00,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878530425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:00,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:00,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:19:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229399760] [2022-04-28 11:19:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:19:00,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:00,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:00,119 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-28 11:19:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:19:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:19:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:19:00,121 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:00,492 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 11:19:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:19:00,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:19:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:19:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:19:00,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 11:19:00,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:00,561 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:19:00,562 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:19:00,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-28 11:19:00,564 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:00,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:19:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:19:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:19:00,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:00,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:19:00,571 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:19:00,571 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:19:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:00,573 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:19:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:00,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:00,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:00,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:19:00,574 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:19:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:00,576 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:19:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:00,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:00,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:00,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:00,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:19:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:19:00,579 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 11:19:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:00,579 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:19:00,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:00,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:19:00,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:19:00,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:00,629 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:00,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:19:00,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:00,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 11:19:00,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:00,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984276030] [2022-04-28 11:19:00,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 11:19:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:00,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200137166] [2022-04-28 11:19:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:00,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:00,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:00,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040128919] [2022-04-28 11:19:00,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:00,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:00,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:00,652 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-28 11:19:00,653 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-28 11:19:00,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:00,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:00,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:19:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:00,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:00,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 11:19:00,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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); {538#true} is VALID [2022-04-28 11:19:00,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:19:00,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 11:19:00,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 11:19:00,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#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; {538#true} is VALID [2022-04-28 11:19:00,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {538#true} is VALID [2022-04-28 11:19:00,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:19:00,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:19:00,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:19:00,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 11:19:00,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:00,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:00,798 INFO L272 TraceCheckUtils]: 13: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {538#true} is VALID [2022-04-28 11:19:00,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:19:00,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:19:00,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:19:00,799 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {538#true} {576#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:00,800 INFO L272 TraceCheckUtils]: 18: Hoare triple {576#(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)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:00,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:00,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 11:19:00,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 11:19:00,801 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-28 11:19:00,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:00,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200137166] [2022-04-28 11:19:00,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:00,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040128919] [2022-04-28 11:19:00,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040128919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:00,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:00,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:00,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:00,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984276030] [2022-04-28 11:19:00,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984276030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:00,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:00,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130292024] [2022-04-28 11:19:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:00,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:00,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:00,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:00,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:00,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:00,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:00,819 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:00,998 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:19:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:00,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:19:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:19:01,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:19:01,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:01,065 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:19:01,065 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:19:01,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:19:01,070 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:01,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:19:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 11:19:01,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:01,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:19:01,091 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:19:01,093 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:19:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,101 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:19:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:19:01,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:01,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:01,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:19:01,105 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:19:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,108 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:19:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:19:01,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:01,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:01,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:01,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:19:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 11:19:01,110 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 11:19:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:01,110 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 11:19:01,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 11:19:01,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 11:19:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:19:01,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:01,167 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:01,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:19:01,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:01,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 11:19:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:01,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735054229] [2022-04-28 11:19:01,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 11:19:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:01,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405808338] [2022-04-28 11:19:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:01,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:01,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334276562] [2022-04-28 11:19:01,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:01,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:01,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:01,398 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-28 11:19:01,399 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-28 11:19:01,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:01,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:01,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:19:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:01,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:01,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 11:19:01,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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); {906#true} is VALID [2022-04-28 11:19:01,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:19:01,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 11:19:01,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 11:19:01,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#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; {906#true} is VALID [2022-04-28 11:19:01,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {906#true} is VALID [2022-04-28 11:19:01,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:19:01,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:19:01,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:19:01,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 11:19:01,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:19:01,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:19:01,538 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {906#true} is VALID [2022-04-28 11:19:01,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:19:01,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:19:01,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:19:01,540 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:19:01,540 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#(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)); {906#true} is VALID [2022-04-28 11:19:01,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:19:01,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:19:01,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:19:01,542 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:19:01,543 INFO L272 TraceCheckUtils]: 23: Hoare triple {944#(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)); {981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:01,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:01,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 11:19:01,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 11:19:01,544 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-28 11:19:01,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:01,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405808338] [2022-04-28 11:19:01,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:01,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334276562] [2022-04-28 11:19:01,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334276562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:01,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:01,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:01,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:01,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735054229] [2022-04-28 11:19:01,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735054229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:01,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:01,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190185658] [2022-04-28 11:19:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:01,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:01,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:01,561 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,792 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 11:19:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:19:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:19:01,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:19:01,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:01,845 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:19:01,845 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:19:01,846 INFO L412 NwaCegarLoop]: 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-28 11:19:01,846 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:01,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:19:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 11:19:01,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:01,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:01,860 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:01,860 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,862 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:19:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:19:01,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:01,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:01,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:19:01,863 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:19:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:01,865 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:19:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:19:01,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:01,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:01,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:01,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 11:19:01,867 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 11:19:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:01,867 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 11:19:01,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:19:01,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 11:19:01,929 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-28 11:19:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 11:19:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:19:01,930 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:01,930 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:01,947 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-28 11:19:02,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 11:19:02,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 11:19:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449567145] [2022-04-28 11:19:02,144 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 11:19:02,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:02,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367811479] [2022-04-28 11:19:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:02,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:02,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:02,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993236130] [2022-04-28 11:19:02,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:02,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:02,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:02,154 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-28 11:19:02,156 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-28 11:19:02,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:02,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:02,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:19:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:02,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:02,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 11:19:02,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#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); {1325#true} is VALID [2022-04-28 11:19:02,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:19:02,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 11:19:02,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 11:19:02,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {1325#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; {1325#true} is VALID [2022-04-28 11:19:02,332 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:19:02,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:19:02,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:19:02,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:19:02,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 11:19:02,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,333 INFO L272 TraceCheckUtils]: 13: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:19:02,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:19:02,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:19:02,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:19:02,335 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,335 INFO L272 TraceCheckUtils]: 18: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:19:02,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:19:02,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:19:02,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:19:02,344 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,345 INFO L272 TraceCheckUtils]: 23: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:19:02,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:19:02,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:19:02,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:19:02,347 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:02,348 INFO L272 TraceCheckUtils]: 28: Hoare triple {1363#(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)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:02,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:02,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 11:19:02,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 11:19:02,349 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-28 11:19:02,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367811479] [2022-04-28 11:19:02,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993236130] [2022-04-28 11:19:02,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993236130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:02,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:02,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:02,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449567145] [2022-04-28 11:19:02,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449567145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:02,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:02,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406808667] [2022-04-28 11:19:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:19:02,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:02,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:19:02,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:02,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:02,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:02,367 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:19:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,606 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 11:19:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:02,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:19:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:19:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:19:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:19:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:19:02,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:19:02,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:02,655 INFO L225 Difference]: With dead ends: 66 [2022-04-28 11:19:02,655 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:19:02,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-28 11:19:02,656 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:02,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:19:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 11:19:02,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:02,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:19:02,671 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:19:02,671 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:19:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,673 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:19:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:19:02,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:02,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:02,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:19:02,674 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:19:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,676 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:19:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:19:02,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:02,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:02,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:02,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:19:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 11:19:02,678 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 11:19:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:02,678 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 11:19:02,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:19:02,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 11:19:02,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:19:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:19:02,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:02,746 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:02,764 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-28 11:19:02,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:02,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 11:19:02,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:02,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048378062] [2022-04-28 11:19:03,255 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:03,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 2 times [2022-04-28 11:19:03,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:03,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642954376] [2022-04-28 11:19:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:03,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:03,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554031823] [2022-04-28 11:19:03,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:03,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:03,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:03,278 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-28 11:19:03,279 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-28 11:19:03,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:03,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:03,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:19:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:03,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:03,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:19:03,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 11:19:03,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:19:03,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:19:03,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-28 11:19:03,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:19:03,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:19:03,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:03,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:03,493 INFO L272 TraceCheckUtils]: 13: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:19:03,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,494 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:03,494 INFO L272 TraceCheckUtils]: 18: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:19:03,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,495 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:03,495 INFO L272 TraceCheckUtils]: 23: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:19:03,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,496 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:03,496 INFO L272 TraceCheckUtils]: 28: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:19:03,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,497 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:03,497 INFO L272 TraceCheckUtils]: 33: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:19:03,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,497 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:03,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {1813#(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; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:03,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !false; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:03,498 INFO L272 TraceCheckUtils]: 40: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:19:03,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,499 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} #62#return; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:03,499 INFO L272 TraceCheckUtils]: 45: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:03,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:03,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:19:03,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:19:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:19:03,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:03,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:19:03,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:19:03,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:03,654 INFO L272 TraceCheckUtils]: 45: Hoare triple {1937#(= (+ (* 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)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:03,654 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:03,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,655 INFO L272 TraceCheckUtils]: 40: Hoare triple {1937#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:19:03,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:03,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:03,663 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:03,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,664 INFO L272 TraceCheckUtils]: 33: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {1775#true} is VALID [2022-04-28 11:19:03,664 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:03,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,665 INFO L272 TraceCheckUtils]: 28: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {1775#true} is VALID [2022-04-28 11:19:03,665 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:03,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,666 INFO L272 TraceCheckUtils]: 23: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:19:03,666 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:03,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,667 INFO L272 TraceCheckUtils]: 18: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {1775#true} is VALID [2022-04-28 11:19:03,668 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:03,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,669 INFO L272 TraceCheckUtils]: 13: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:19:03,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:03,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:03,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:19:03,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:19:03,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 11:19:03,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:19:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:19:03,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:03,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642954376] [2022-04-28 11:19:03,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:03,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554031823] [2022-04-28 11:19:03,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554031823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:03,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:03,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:19:03,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048378062] [2022-04-28 11:19:03,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048378062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:03,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:03,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:19:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015099416] [2022-04-28 11:19:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:19:03,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:03,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:19:03,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:03,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:19:03,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:03,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:19:03,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:19:03,699 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:19:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:04,102 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 11:19:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:19:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:19:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:19:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:19:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:19:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:19:04,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:19:04,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:04,177 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:19:04,177 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 11:19:04,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 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-28 11:19:04,178 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:04,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 11:19:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-04-28 11:19:04,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:04,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:04,213 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:04,214 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:04,217 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:19:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:19:04,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:04,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:04,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:19:04,217 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:19:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:04,220 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:19:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:19:04,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:04,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:04,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:04,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:19:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-04-28 11:19:04,222 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2022-04-28 11:19:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:04,223 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-04-28 11:19:04,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:19:04,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 79 transitions. [2022-04-28 11:19:04,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 11:19:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 11:19:04,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:04,300 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:04,316 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-28 11:19:04,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:04,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 3 times [2022-04-28 11:19:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:04,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465556940] [2022-04-28 11:19:04,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:04,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 4 times [2022-04-28 11:19:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:04,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685781297] [2022-04-28 11:19:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:04,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:04,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384224029] [2022-04-28 11:19:04,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:04,805 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-28 11:19:04,806 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-28 11:19:04,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:04,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:04,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:19:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:04,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:05,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#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); {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#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; {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:19:05,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:05,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:05,079 INFO L272 TraceCheckUtils]: 13: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:19:05,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,084 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:05,084 INFO L272 TraceCheckUtils]: 18: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:19:05,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,086 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:05,086 INFO L272 TraceCheckUtils]: 23: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:19:05,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,086 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:05,087 INFO L272 TraceCheckUtils]: 28: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:19:05,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,087 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:05,087 INFO L272 TraceCheckUtils]: 33: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:19:05,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,089 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:19:05,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {2574#(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; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:19:05,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} assume !false; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:19:05,090 INFO L272 TraceCheckUtils]: 40: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:19:05,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,091 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #62#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:19:05,091 INFO L272 TraceCheckUtils]: 45: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:19:05,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,092 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #64#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:19:05,093 INFO L272 TraceCheckUtils]: 50: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:05,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:05,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:19:05,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:19:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:19:05,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:05,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:19:05,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:19:05,289 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:05,290 INFO L272 TraceCheckUtils]: 50: Hoare triple {2713#(= (* 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)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:05,290 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:05,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,290 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,291 INFO L272 TraceCheckUtils]: 45: Hoare triple {2713#(= (* 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)); {2536#true} is VALID [2022-04-28 11:19:05,291 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:05,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,292 INFO L272 TraceCheckUtils]: 40: Hoare triple {2713#(= (* 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)); {2536#true} is VALID [2022-04-28 11:19:05,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:05,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {2750#(= (* (+ 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; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:05,294 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:05,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,295 INFO L272 TraceCheckUtils]: 33: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:19:05,295 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:05,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,295 INFO L272 TraceCheckUtils]: 28: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:19:05,296 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:05,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,296 INFO L272 TraceCheckUtils]: 23: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:19:05,297 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:05,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,297 INFO L272 TraceCheckUtils]: 18: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:19:05,297 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:05,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,298 INFO L272 TraceCheckUtils]: 13: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:19:05,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:05,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:05,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:19:05,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:19:05,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:19:05,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:19:05,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#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; {2536#true} is VALID [2022-04-28 11:19:05,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:19:05,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:19:05,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:19:05,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#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); {2536#true} is VALID [2022-04-28 11:19:05,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:19:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:19:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685781297] [2022-04-28 11:19:05,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384224029] [2022-04-28 11:19:05,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384224029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:05,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:05,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:19:05,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:05,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465556940] [2022-04-28 11:19:05,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465556940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:05,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:05,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:19:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963605956] [2022-04-28 11:19:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:05,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:19:05,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:05,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:19:05,324 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-28 11:19:05,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:19:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:05,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:19:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:19:05,325 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:19:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:05,653 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 11:19:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:19:05,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:19:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:19:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:19:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:19:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:19:05,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:19:05,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:05,732 INFO L225 Difference]: With dead ends: 85 [2022-04-28 11:19:05,733 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 11:19:05,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 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-28 11:19:05,733 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:05,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 196 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 11:19:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 11:19:05,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:05,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:19:05,760 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:19:05,761 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:19:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:05,763 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:19:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:19:05,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:05,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:05,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:19:05,764 INFO L87 Difference]: Start difference. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:19:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:05,766 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:19:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:19:05,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:05,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:05,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:05,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:19:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-04-28 11:19:05,769 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 54 [2022-04-28 11:19:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:05,769 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-04-28 11:19:05,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:19:05,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 84 transitions. [2022-04-28 11:19:05,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-04-28 11:19:05,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:19:05,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:05,846 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:05,861 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-28 11:19:06,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:06,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 5 times [2022-04-28 11:19:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:06,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975880642] [2022-04-28 11:19:06,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:06,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 6 times [2022-04-28 11:19:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:06,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251490629] [2022-04-28 11:19:06,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:06,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:06,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542797313] [2022-04-28 11:19:06,301 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:19:06,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:06,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:06,302 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-28 11:19:06,303 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-28 11:19:06,366 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:19:06,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:06,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:19:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:06,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:06,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:19:06,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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); {3353#true} is VALID [2022-04-28 11:19:06,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#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; {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:19:06,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:06,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:06,592 INFO L272 TraceCheckUtils]: 13: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:19:06,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,593 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:06,593 INFO L272 TraceCheckUtils]: 18: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:19:06,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,594 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:06,594 INFO L272 TraceCheckUtils]: 23: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:19:06,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,595 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:06,595 INFO L272 TraceCheckUtils]: 28: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:19:06,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,596 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:06,596 INFO L272 TraceCheckUtils]: 33: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:19:06,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,597 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:06,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {3391#(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; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:19:06,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} assume !false; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:19:06,599 INFO L272 TraceCheckUtils]: 40: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:19:06,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,604 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #62#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:19:06,604 INFO L272 TraceCheckUtils]: 45: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~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)); {3353#true} is VALID [2022-04-28 11:19:06,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,605 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #64#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:19:06,605 INFO L272 TraceCheckUtils]: 50: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:19:06,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,606 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #66#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:19:06,607 INFO L272 TraceCheckUtils]: 55: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~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)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:06,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:06,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:19:06,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:19:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:19:06,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:06,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:19:06,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:19:06,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:06,954 INFO L272 TraceCheckUtils]: 55: Hoare triple {3545#(= (+ (* 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)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:06,955 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:06,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,955 INFO L272 TraceCheckUtils]: 50: Hoare triple {3545#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,956 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:06,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,956 INFO L272 TraceCheckUtils]: 45: Hoare triple {3545#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,957 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:06,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,957 INFO L272 TraceCheckUtils]: 40: Hoare triple {3545#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:06,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {3597#(= (+ (* 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; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:06,961 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #70#return; {3597#(= (+ (* 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-28 11:19:06,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,961 INFO L272 TraceCheckUtils]: 33: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,962 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #68#return; {3597#(= (+ (* 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-28 11:19:06,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,962 INFO L272 TraceCheckUtils]: 28: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,963 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #66#return; {3597#(= (+ (* 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-28 11:19:06,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,963 INFO L272 TraceCheckUtils]: 23: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,963 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #64#return; {3597#(= (+ (* 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-28 11:19:06,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,964 INFO L272 TraceCheckUtils]: 18: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,964 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #62#return; {3597#(= (+ (* 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-28 11:19:06,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,965 INFO L272 TraceCheckUtils]: 13: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:19:06,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(= (+ (* 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 !false; {3597#(= (+ (* 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-28 11:19:06,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3597#(= (+ (* 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-28 11:19:06,965 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#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; {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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); {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:19:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:19:06,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:06,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251490629] [2022-04-28 11:19:06,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:06,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542797313] [2022-04-28 11:19:06,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542797313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:06,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:06,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:19:06,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:06,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975880642] [2022-04-28 11:19:06,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975880642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:06,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:06,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:19:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759174433] [2022-04-28 11:19:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:06,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:19:06,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:06,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:19:07,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:07,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:19:07,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:19:07,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:19:07,007 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:19:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:07,472 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 11:19:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:19:07,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:19:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:19:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:19:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:19:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:19:07,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:19:07,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:07,542 INFO L225 Difference]: With dead ends: 89 [2022-04-28 11:19:07,542 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:19:07,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:19:07,542 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:07,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:19:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 11:19:07,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:07,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:07,586 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:07,593 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:07,596 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:19:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:19:07,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:07,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:07,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:19:07,598 INFO L87 Difference]: Start difference. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:19:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:07,600 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:19:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:19:07,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:07,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:07,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:07,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-28 11:19:07,604 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 59 [2022-04-28 11:19:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:07,604 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-28 11:19:07,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:19:07,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-28 11:19:07,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:19:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 11:19:07,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:07,696 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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, 1, 1, 1, 1] [2022-04-28 11:19:07,712 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-28 11:19:07,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:07,896 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:07,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-28 11:19:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:07,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771040160] [2022-04-28 11:19:08,146 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:08,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 2 times [2022-04-28 11:19:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:08,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676066554] [2022-04-28 11:19:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:08,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:08,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286573298] [2022-04-28 11:19:08,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:08,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:08,155 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-28 11:19:08,156 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-28 11:19:08,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:08,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:08,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:19:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:08,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:08,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {4230#true} call ULTIMATE.init(); {4230#true} is VALID [2022-04-28 11:19:08,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {4230#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); {4230#true} is VALID [2022-04-28 11:19:08,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4230#true} {4230#true} #84#return; {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {4230#true} call #t~ret5 := main(); {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {4230#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; {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L272 TraceCheckUtils]: 6: Hoare triple {4230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4230#true} {4230#true} #60#return; {4230#true} is VALID [2022-04-28 11:19:08,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {4230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,627 INFO L272 TraceCheckUtils]: 13: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:19:08,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,629 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,629 INFO L272 TraceCheckUtils]: 18: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:19:08,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,629 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,629 INFO L272 TraceCheckUtils]: 23: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:19:08,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,630 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,630 INFO L272 TraceCheckUtils]: 28: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:19:08,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,631 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,631 INFO L272 TraceCheckUtils]: 33: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:19:08,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,635 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {4268#(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; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:19:08,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:19:08,636 INFO L272 TraceCheckUtils]: 40: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:19:08,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,637 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:19:08,637 INFO L272 TraceCheckUtils]: 45: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:19:08,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,638 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:19:08,638 INFO L272 TraceCheckUtils]: 50: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:19:08,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,642 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:19:08,642 INFO L272 TraceCheckUtils]: 55: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~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)); {4230#true} is VALID [2022-04-28 11:19:08,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,642 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:19:08,643 INFO L272 TraceCheckUtils]: 60: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~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)); {4230#true} is VALID [2022-04-28 11:19:08,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,643 INFO L290 TraceCheckUtils]: 63: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,643 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:19:08,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:19:08,644 INFO L272 TraceCheckUtils]: 66: Hoare triple {4432#(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)); {4230#true} is VALID [2022-04-28 11:19:08,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:19:08,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:19:08,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:19:08,645 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4230#true} {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:19:08,646 INFO L272 TraceCheckUtils]: 71: Hoare triple {4432#(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)); {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:08,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4455#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:08,646 INFO L290 TraceCheckUtils]: 73: Hoare triple {4455#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4231#false} is VALID [2022-04-28 11:19:08,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {4231#false} assume !false; {4231#false} is VALID [2022-04-28 11:19:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:19:08,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:08,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676066554] [2022-04-28 11:19:08,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:08,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286573298] [2022-04-28 11:19:08,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286573298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:19:08,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:19:08,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:19:08,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:08,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771040160] [2022-04-28 11:19:08,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771040160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:08,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:08,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:19:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362721958] [2022-04-28 11:19:08,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:08,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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 75 [2022-04-28 11:19:08,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:08,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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-28 11:19:09,024 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-28 11:19:09,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:19:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:19:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:19:09,024 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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-28 11:19:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:09,599 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 11:19:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:19:09,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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 75 [2022-04-28 11:19:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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-28 11:19:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:19:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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-28 11:19:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:19:09,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:19:09,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:09,673 INFO L225 Difference]: With dead ends: 94 [2022-04-28 11:19:09,673 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 11:19:09,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:19:09,674 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:09,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 11:19:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 11:19:09,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:09,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:09,723 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:09,723 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:09,725 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:19:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:19:09,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:09,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:09,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:19:09,726 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:19:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:09,728 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:19:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:19:09,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:09,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:09,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:09,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-04-28 11:19:09,730 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 75 [2022-04-28 11:19:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:09,730 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-04-28 11:19:09,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (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-28 11:19:09,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 104 transitions. [2022-04-28 11:19:09,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:19:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:19:09,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:09,849 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:09,865 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-28 11:19:10,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:10,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 7 times [2022-04-28 11:19:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:10,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513687156] [2022-04-28 11:19:10,318 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:10,318 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 8 times [2022-04-28 11:19:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:10,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853861553] [2022-04-28 11:19:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:10,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:10,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956755494] [2022-04-28 11:19:10,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:10,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:10,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:10,335 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-28 11:19:10,336 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-28 11:19:10,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:10,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:10,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 11:19:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:10,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:10,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#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); {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#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; {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,748 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:19:10,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:19:10,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !false; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:19:10,749 INFO L272 TraceCheckUtils]: 13: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,750 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #62#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:19:10,750 INFO L272 TraceCheckUtils]: 18: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,750 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #64#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:19:10,750 INFO L272 TraceCheckUtils]: 23: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,751 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #66#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:19:10,751 INFO L272 TraceCheckUtils]: 28: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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)); {5138#true} is VALID [2022-04-28 11:19:10,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,752 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #68#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:19:10,752 INFO L272 TraceCheckUtils]: 33: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,752 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #70#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:19:10,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= 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; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:10,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} assume !false; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:10,753 INFO L272 TraceCheckUtils]: 40: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,754 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #62#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:10,754 INFO L272 TraceCheckUtils]: 45: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) 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)); {5138#true} is VALID [2022-04-28 11:19:10,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,755 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #64#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:10,755 INFO L272 TraceCheckUtils]: 50: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,756 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #66#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:10,756 INFO L272 TraceCheckUtils]: 55: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) 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)); {5138#true} is VALID [2022-04-28 11:19:10,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,756 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,757 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #68#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:19:10,757 INFO L272 TraceCheckUtils]: 60: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) 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)); {5138#true} is VALID [2022-04-28 11:19:10,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:10,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:10,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:10,758 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #70#return; {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} is VALID [2022-04-28 11:19:10,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:19:10,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} assume !false; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:19:10,759 INFO L272 TraceCheckUtils]: 67: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:10,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:10,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:10,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:10,759 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} #62#return; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:19:10,760 INFO L272 TraceCheckUtils]: 72: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:10,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:10,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:19:10,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:19:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:19:10,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:11,504 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:19:11,505 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:19:11,505 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:11,506 INFO L272 TraceCheckUtils]: 72: Hoare triple {5385#(= (+ (* 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)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:11,506 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:11,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,507 INFO L272 TraceCheckUtils]: 67: Hoare triple {5385#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:19:11,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:11,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {5407#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:11,512 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {5407#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:11,512 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:11,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:11,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:11,513 INFO L272 TraceCheckUtils]: 60: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,513 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:11,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,514 INFO L272 TraceCheckUtils]: 55: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {5138#true} is VALID [2022-04-28 11:19:11,514 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:11,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,514 INFO L272 TraceCheckUtils]: 50: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,515 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:11,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,515 INFO L272 TraceCheckUtils]: 45: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,516 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:11,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,516 INFO L272 TraceCheckUtils]: 40: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:11,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 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; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:11,522 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #70#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:19:11,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,522 INFO L272 TraceCheckUtils]: 33: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,522 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #68#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:19:11,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,523 INFO L272 TraceCheckUtils]: 28: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,527 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #66#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:19:11,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,528 INFO L272 TraceCheckUtils]: 23: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,530 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #64#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:19:11,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,530 INFO L272 TraceCheckUtils]: 18: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,530 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #62#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:19:11,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,531 INFO L272 TraceCheckUtils]: 13: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !false; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:19:11,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:19:11,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#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; {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#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); {5138#true} is VALID [2022-04-28 11:19:11,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:19:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:19:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:11,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853861553] [2022-04-28 11:19:11,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:11,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956755494] [2022-04-28 11:19:11,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956755494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:11,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:11,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-28 11:19:11,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:11,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513687156] [2022-04-28 11:19:11,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513687156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:11,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:11,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:19:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956220525] [2022-04-28 11:19:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:19:11,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:11,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:19:11,568 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-28 11:19:11,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:19:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:19:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:19:11,568 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:19:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:13,271 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-28 11:19:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:19:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:19:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:19:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:19:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:19:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:19:13,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:19:13,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:13,353 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:19:13,353 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 11:19:13,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:19:13,354 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:13,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 151 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:19:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 11:19:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 11:19:13,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:13,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:19:13,423 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:19:13,423 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:19:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:13,425 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:19:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:19:13,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:13,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:13,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:19:13,426 INFO L87 Difference]: Start difference. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:19:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:13,428 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:19:13,428 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:19:13,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:13,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:13,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:13,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:19:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-28 11:19:13,431 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 76 [2022-04-28 11:19:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:13,431 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-28 11:19:13,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:19:13,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-28 11:19:13,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-28 11:19:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 11:19:13,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:13,553 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:13,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:13,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:19:13,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-28 11:19:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [769983810] [2022-04-28 11:19:14,012 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:14,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 2 times [2022-04-28 11:19:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:14,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224316072] [2022-04-28 11:19:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:14,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:14,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246863599] [2022-04-28 11:19:14,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:14,028 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-28 11:19:14,029 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-28 11:19:14,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:14,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:14,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:19:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:14,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:14,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {6274#true} call ULTIMATE.init(); {6274#true} is VALID [2022-04-28 11:19:14,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {6274#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); {6274#true} is VALID [2022-04-28 11:19:14,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6274#true} {6274#true} #84#return; {6274#true} is VALID [2022-04-28 11:19:14,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {6274#true} call #t~ret5 := main(); {6274#true} is VALID [2022-04-28 11:19:14,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {6274#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; {6274#true} is VALID [2022-04-28 11:19:14,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {6274#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:19:14,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6274#true} {6274#true} #60#return; {6274#true} is VALID [2022-04-28 11:19:14,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {6274#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:19:14,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !false; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:19:14,640 INFO L272 TraceCheckUtils]: 13: Hoare triple {6312#(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)); {6274#true} is VALID [2022-04-28 11:19:14,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,641 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #62#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:19:14,641 INFO L272 TraceCheckUtils]: 18: Hoare triple {6312#(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)); {6274#true} is VALID [2022-04-28 11:19:14,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,641 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #64#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:19:14,641 INFO L272 TraceCheckUtils]: 23: Hoare triple {6312#(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)); {6274#true} is VALID [2022-04-28 11:19:14,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,653 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #66#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:19:14,654 INFO L272 TraceCheckUtils]: 28: Hoare triple {6312#(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)); {6274#true} is VALID [2022-04-28 11:19:14,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,654 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #68#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:19:14,654 INFO L272 TraceCheckUtils]: 33: Hoare triple {6312#(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)); {6274#true} is VALID [2022-04-28 11:19:14,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,655 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #70#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:19:14,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {6312#(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; {6394#(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-28 11:19:14,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !false; {6394#(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-28 11:19:14,656 INFO L272 TraceCheckUtils]: 40: Hoare triple {6394#(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)); {6274#true} is VALID [2022-04-28 11:19:14,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,657 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #62#return; {6394#(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-28 11:19:14,657 INFO L272 TraceCheckUtils]: 45: Hoare triple {6394#(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)); {6274#true} is VALID [2022-04-28 11:19:14,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,657 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #64#return; {6394#(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-28 11:19:14,657 INFO L272 TraceCheckUtils]: 50: Hoare triple {6394#(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)); {6274#true} is VALID [2022-04-28 11:19:14,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,658 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #66#return; {6394#(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-28 11:19:14,658 INFO L272 TraceCheckUtils]: 55: Hoare triple {6394#(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)); {6274#true} is VALID [2022-04-28 11:19:14,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,658 INFO L290 TraceCheckUtils]: 57: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,659 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #68#return; {6394#(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-28 11:19:14,659 INFO L272 TraceCheckUtils]: 60: Hoare triple {6394#(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)); {6274#true} is VALID [2022-04-28 11:19:14,659 INFO L290 TraceCheckUtils]: 61: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,659 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #70#return; {6394#(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-28 11:19:14,660 INFO L290 TraceCheckUtils]: 65: Hoare triple {6394#(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); {6476#(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-28 11:19:14,660 INFO L272 TraceCheckUtils]: 66: Hoare triple {6476#(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)); {6274#true} is VALID [2022-04-28 11:19:14,660 INFO L290 TraceCheckUtils]: 67: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,660 INFO L290 TraceCheckUtils]: 69: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,660 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #72#return; {6476#(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-28 11:19:14,661 INFO L272 TraceCheckUtils]: 71: Hoare triple {6476#(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)); {6274#true} is VALID [2022-04-28 11:19:14,661 INFO L290 TraceCheckUtils]: 72: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:19:14,661 INFO L290 TraceCheckUtils]: 73: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:19:14,661 INFO L290 TraceCheckUtils]: 74: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:19:14,661 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #74#return; {6476#(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-28 11:19:14,662 INFO L272 TraceCheckUtils]: 76: Hoare triple {6476#(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)); {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:14,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:14,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {6514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6275#false} is VALID [2022-04-28 11:19:14,663 INFO L290 TraceCheckUtils]: 79: Hoare triple {6275#false} assume !false; {6275#false} is VALID [2022-04-28 11:19:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:19:14,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:27,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224316072] [2022-04-28 11:19:27,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:27,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246863599] [2022-04-28 11:19:27,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246863599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:19:27,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:19:27,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:19:27,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:27,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [769983810] [2022-04-28 11:19:27,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [769983810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:27,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:27,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:19:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759723829] [2022-04-28 11:19:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:19:27,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:27,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:27,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:27,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:19:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:19:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:19:27,810 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:28,333 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:19:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:19:28,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:19:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:19:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:19:28,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:19:28,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:28,394 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:19:28,394 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:19:28,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 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-28 11:19:28,395 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:28,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:19:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:19:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:19:28,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:28,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:28,443 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:28,443 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:28,445 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:19:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:19:28,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:28,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:28,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:19:28,445 INFO L87 Difference]: Start difference. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:19:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:28,447 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:19:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:19:28,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:28,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:28,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:28,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:19:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-04-28 11:19:28,449 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 80 [2022-04-28 11:19:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:28,449 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-04-28 11:19:28,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:28,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 106 transitions. [2022-04-28 11:19:28,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:19:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:19:28,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:28,563 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:28,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:28,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:28,767 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 9 times [2022-04-28 11:19:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:28,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938729029] [2022-04-28 11:19:29,081 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:29,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 10 times [2022-04-28 11:19:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:29,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886128002] [2022-04-28 11:19:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:29,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:29,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125192501] [2022-04-28 11:19:29,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:29,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:29,099 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-28 11:19:29,102 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-28 11:19:29,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:29,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:29,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:19:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:29,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:29,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#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); {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#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; {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:19:29,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:29,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:29,410 INFO L272 TraceCheckUtils]: 13: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:19:29,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,411 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:29,411 INFO L272 TraceCheckUtils]: 18: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:19:29,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,412 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:29,412 INFO L272 TraceCheckUtils]: 23: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:19:29,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,412 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:29,412 INFO L272 TraceCheckUtils]: 28: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:19:29,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,413 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:29,413 INFO L272 TraceCheckUtils]: 33: Hoare triple {7296#(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)); {7258#true} is VALID [2022-04-28 11:19:29,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,414 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:29,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {7296#(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; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,415 INFO L272 TraceCheckUtils]: 40: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,419 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,420 INFO L272 TraceCheckUtils]: 45: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 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)); {7258#true} is VALID [2022-04-28 11:19:29,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,420 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,420 INFO L272 TraceCheckUtils]: 50: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 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)); {7258#true} is VALID [2022-04-28 11:19:29,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,421 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,421 INFO L272 TraceCheckUtils]: 55: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 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)); {7258#true} is VALID [2022-04-28 11:19:29,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,422 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,422 INFO L272 TraceCheckUtils]: 60: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 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)); {7258#true} is VALID [2022-04-28 11:19:29,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,423 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 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; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} assume !false; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,424 INFO L272 TraceCheckUtils]: 67: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,424 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #62#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,425 INFO L272 TraceCheckUtils]: 72: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,425 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,425 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #64#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:29,426 INFO L272 TraceCheckUtils]: 77: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:29,426 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:29,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:19:29,426 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:19:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:19:29,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:29,682 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:19:29,682 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:19:29,683 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:29,683 INFO L272 TraceCheckUtils]: 77: Hoare triple {7517#(= (* 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)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:29,684 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:29,684 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,684 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,684 INFO L272 TraceCheckUtils]: 72: Hoare triple {7517#(= (* 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)); {7258#true} is VALID [2022-04-28 11:19:29,684 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:29,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,685 INFO L272 TraceCheckUtils]: 67: Hoare triple {7517#(= (* 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)); {7258#true} is VALID [2022-04-28 11:19:29,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:29,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {7554#(= (* (+ 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; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:29,687 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:29,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,687 INFO L272 TraceCheckUtils]: 60: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:19:29,688 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:29,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,688 INFO L272 TraceCheckUtils]: 55: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:19:29,689 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:29,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,689 INFO L272 TraceCheckUtils]: 50: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:19:29,689 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:29,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,690 INFO L272 TraceCheckUtils]: 45: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:19:29,690 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:29,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,690 INFO L272 TraceCheckUtils]: 40: Hoare triple {7554#(= (* (+ 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)); {7258#true} is VALID [2022-04-28 11:19:29,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:29,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:29,693 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:29,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,693 INFO L272 TraceCheckUtils]: 33: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,694 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:29,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,694 INFO L272 TraceCheckUtils]: 28: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {7258#true} is VALID [2022-04-28 11:19:29,694 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:29,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,695 INFO L272 TraceCheckUtils]: 23: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,695 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:29,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,695 INFO L272 TraceCheckUtils]: 18: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,696 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:29,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,696 INFO L272 TraceCheckUtils]: 13: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:29,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:29,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:19:29,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:19:29,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:19:29,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:19:29,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#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; {7258#true} is VALID [2022-04-28 11:19:29,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:19:29,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:19:29,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:19:29,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#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); {7258#true} is VALID [2022-04-28 11:19:29,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:19:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:19:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:29,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886128002] [2022-04-28 11:19:29,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:29,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125192501] [2022-04-28 11:19:29,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125192501] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:29,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:29,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:19:29,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938729029] [2022-04-28 11:19:29,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938729029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:29,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:29,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:19:29,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595873439] [2022-04-28 11:19:29,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:19:29,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:29,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:29,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:29,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:19:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:19:29,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:19:29,737 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:30,597 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 11:19:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:19:30,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:19:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:19:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:19:30,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-04-28 11:19:30,672 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-28 11:19:30,674 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:19:30,674 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:19:30,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:19:30,674 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:30,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 222 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:19:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:19:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-04-28 11:19:30,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:30,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:19:30,732 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:19:30,733 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:19:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:30,734 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:19:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:19:30,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:30,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:30,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:19:30,735 INFO L87 Difference]: Start difference. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:19:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:30,737 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:19:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:19:30,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:30,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:30,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:30,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:19:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:19:30,739 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 81 [2022-04-28 11:19:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:30,740 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:19:30,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:19:30,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:19:30,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:19:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:19:30,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:30,853 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:30,868 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-28 11:19:31,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:19:31,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:31,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 11 times [2022-04-28 11:19:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:31,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245928815] [2022-04-28 11:19:31,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:31,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 12 times [2022-04-28 11:19:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:31,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862968742] [2022-04-28 11:19:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:31,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:31,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775557928] [2022-04-28 11:19:31,323 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:19:31,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:31,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:31,324 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-28 11:19:31,325 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-28 11:19:31,366 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:19:31,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:31,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:19:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:31,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:31,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#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); {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#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; {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:19:31,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:31,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:31,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:19:31,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,735 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:31,735 INFO L272 TraceCheckUtils]: 18: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:19:31,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,736 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:31,736 INFO L272 TraceCheckUtils]: 23: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:19:31,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,737 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:31,737 INFO L272 TraceCheckUtils]: 28: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:19:31,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,737 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:31,738 INFO L272 TraceCheckUtils]: 33: Hoare triple {8439#(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)); {8401#true} is VALID [2022-04-28 11:19:31,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,738 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:31,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {8439#(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; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:31,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:31,739 INFO L272 TraceCheckUtils]: 40: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:31,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,740 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:31,740 INFO L272 TraceCheckUtils]: 45: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {8401#true} is VALID [2022-04-28 11:19:31,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,740 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:31,740 INFO L272 TraceCheckUtils]: 50: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:31,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,741 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:31,741 INFO L272 TraceCheckUtils]: 55: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {8401#true} is VALID [2022-04-28 11:19:31,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,742 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:31,742 INFO L272 TraceCheckUtils]: 60: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {8401#true} is VALID [2022-04-28 11:19:31,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:31,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:31,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:31,743 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:31,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:19:31,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} assume !false; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:19:31,744 INFO L272 TraceCheckUtils]: 67: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:31,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,744 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #62#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:19:31,744 INFO L272 TraceCheckUtils]: 72: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:31,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,745 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,745 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #64#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:19:31,745 INFO L272 TraceCheckUtils]: 77: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:31,745 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:31,745 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:31,745 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:31,746 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #66#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:19:31,746 INFO L272 TraceCheckUtils]: 82: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~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)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:31,747 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:31,747 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:19:31,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:19:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 11:19:31,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:32,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:19:32,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:19:32,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:32,384 INFO L272 TraceCheckUtils]: 82: Hoare triple {8677#(= (+ (* 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)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:32,385 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:32,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:32,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:32,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:32,385 INFO L272 TraceCheckUtils]: 77: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:19:32,385 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:32,386 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:32,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:32,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:32,386 INFO L272 TraceCheckUtils]: 72: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:19:32,386 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:32,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:32,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:32,386 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:32,386 INFO L272 TraceCheckUtils]: 67: Hoare triple {8677#(= (+ (* 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)); {8401#true} is VALID [2022-04-28 11:19:32,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:32,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {8729#(= (+ (* 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; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:19:32,390 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8729#(= (+ (* 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-28 11:19:32,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:32,391 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:32,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:19:32,391 INFO L272 TraceCheckUtils]: 60: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:32,392 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:32,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:32,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:32,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:32,392 INFO L272 TraceCheckUtils]: 55: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {8401#true} is VALID [2022-04-28 11:19:32,393 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:32,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:32,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:32,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:32,393 INFO L272 TraceCheckUtils]: 50: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:32,393 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:32,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:32,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:32,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:32,394 INFO L272 TraceCheckUtils]: 45: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:32,394 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:32,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:32,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:32,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:32,394 INFO L272 TraceCheckUtils]: 40: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:32,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,539 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:33,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:33,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:33,540 INFO L272 TraceCheckUtils]: 33: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:33,540 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:33,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:33,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:33,540 INFO L272 TraceCheckUtils]: 28: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {8401#true} is VALID [2022-04-28 11:19:33,541 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:33,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:33,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:33,541 INFO L272 TraceCheckUtils]: 23: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:33,542 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:33,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:33,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:33,542 INFO L272 TraceCheckUtils]: 18: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:33,542 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:33,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:33,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:33,543 INFO L272 TraceCheckUtils]: 13: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:33,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8733#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:19:33,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#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; {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#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); {8401#true} is VALID [2022-04-28 11:19:33,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:19:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-04-28 11:19:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862968742] [2022-04-28 11:19:33,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775557928] [2022-04-28 11:19:33,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775557928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:33,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:33,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:19:33,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245928815] [2022-04-28 11:19:33,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245928815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:33,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:33,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:19:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908758300] [2022-04-28 11:19:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:19:33,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:33,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:19:33,584 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-28 11:19:33,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:19:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:19:33,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:19:33,585 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:19:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:34,668 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 11:19:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:19:34,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:19:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:19:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:19:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:19:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:19:34,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-28 11:19:34,754 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-28 11:19:34,756 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:19:34,756 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 11:19:34,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:19:34,756 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:34,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 151 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:19:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 11:19:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 11:19:34,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:34,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:34,816 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:34,816 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:34,818 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:19:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:19:34,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:34,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:34,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:19:34,819 INFO L87 Difference]: Start difference. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:19:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:34,820 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:19:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:19:34,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:34,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:34,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:34,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-28 11:19:34,823 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 86 [2022-04-28 11:19:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:34,823 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-28 11:19:34,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:19:34,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-28 11:19:34,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:19:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 11:19:34,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:34,955 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 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, 1, 1, 1, 1] [2022-04-28 11:19:34,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 11:19:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:19:35,162 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 3 times [2022-04-28 11:19:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:35,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801709352] [2022-04-28 11:19:35,369 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:35,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 4 times [2022-04-28 11:19:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:35,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765758271] [2022-04-28 11:19:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:35,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:35,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291555419] [2022-04-28 11:19:35,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:35,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:35,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:35,390 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-28 11:19:35,390 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-28 11:19:35,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:35,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:35,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:19:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:35,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:35,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {9609#true} call ULTIMATE.init(); {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {9609#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); {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9609#true} {9609#true} #84#return; {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {9609#true} call #t~ret5 := main(); {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {9609#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; {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {9609#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,957 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9609#true} {9609#true} #60#return; {9609#true} is VALID [2022-04-28 11:19:35,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {9609#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:35,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:35,962 INFO L272 TraceCheckUtils]: 13: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:19:35,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,963 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:35,963 INFO L272 TraceCheckUtils]: 18: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:19:35,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,964 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:35,964 INFO L272 TraceCheckUtils]: 23: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:19:35,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,964 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:35,964 INFO L272 TraceCheckUtils]: 28: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:19:35,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,965 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:35,965 INFO L272 TraceCheckUtils]: 33: Hoare triple {9647#(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)); {9609#true} is VALID [2022-04-28 11:19:35,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,966 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:35,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {9647#(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; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:35,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:35,967 INFO L272 TraceCheckUtils]: 40: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,968 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:35,968 INFO L272 TraceCheckUtils]: 45: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) 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)); {9609#true} is VALID [2022-04-28 11:19:35,968 INFO L290 TraceCheckUtils]: 46: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,968 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:35,969 INFO L272 TraceCheckUtils]: 50: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,969 INFO L290 TraceCheckUtils]: 53: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,969 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:35,969 INFO L272 TraceCheckUtils]: 55: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) 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)); {9609#true} is VALID [2022-04-28 11:19:35,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,970 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:35,970 INFO L272 TraceCheckUtils]: 60: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) 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)); {9609#true} is VALID [2022-04-28 11:19:35,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,970 INFO L290 TraceCheckUtils]: 63: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,971 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:35,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) 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; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !false; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,972 INFO L272 TraceCheckUtils]: 67: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,972 INFO L290 TraceCheckUtils]: 68: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,972 INFO L290 TraceCheckUtils]: 69: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,972 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #62#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,972 INFO L272 TraceCheckUtils]: 72: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,973 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #64#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,973 INFO L272 TraceCheckUtils]: 77: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,973 INFO L290 TraceCheckUtils]: 80: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,974 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #66#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,974 INFO L272 TraceCheckUtils]: 82: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~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)); {9609#true} is VALID [2022-04-28 11:19:35,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,974 INFO L290 TraceCheckUtils]: 85: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,975 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #68#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,975 INFO L272 TraceCheckUtils]: 87: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,975 INFO L290 TraceCheckUtils]: 88: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,975 INFO L290 TraceCheckUtils]: 89: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,975 INFO L290 TraceCheckUtils]: 90: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,975 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #70#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,976 INFO L290 TraceCheckUtils]: 92: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !(~n~0 <= ~a~0); {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,976 INFO L272 TraceCheckUtils]: 93: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:19:35,976 INFO L290 TraceCheckUtils]: 94: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:19:35,976 INFO L290 TraceCheckUtils]: 95: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:19:35,976 INFO L290 TraceCheckUtils]: 96: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:19:35,977 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {9609#true} {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} #72#return; {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:19:35,977 INFO L272 TraceCheckUtils]: 98: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:35,978 INFO L290 TraceCheckUtils]: 99: Hoare triple {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:35,978 INFO L290 TraceCheckUtils]: 100: Hoare triple {9916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9610#false} is VALID [2022-04-28 11:19:35,978 INFO L290 TraceCheckUtils]: 101: Hoare triple {9610#false} assume !false; {9610#false} is VALID [2022-04-28 11:19:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:19:35,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:36,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765758271] [2022-04-28 11:19:36,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:36,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291555419] [2022-04-28 11:19:36,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291555419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:19:36,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:19:36,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:19:36,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:36,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801709352] [2022-04-28 11:19:36,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801709352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:36,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:36,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:19:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817097804] [2022-04-28 11:19:36,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:36,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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 102 [2022-04-28 11:19:36,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:36,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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-28 11:19:36,366 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-28 11:19:36,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:19:36,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:19:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:19:36,367 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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-28 11:19:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:37,186 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 11:19:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:19:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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 102 [2022-04-28 11:19:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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-28 11:19:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:19:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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-28 11:19:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:19:37,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:19:37,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:37,261 INFO L225 Difference]: With dead ends: 117 [2022-04-28 11:19:37,261 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:19:37,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:19:37,261 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:37,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:19:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:19:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 11:19:37,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:37,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:37,332 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:37,333 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:37,334 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:19:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:19:37,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:37,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:37,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:19:37,335 INFO L87 Difference]: Start difference. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:19:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:37,337 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:19:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:19:37,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:37,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:37,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:37,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-04-28 11:19:37,339 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 102 [2022-04-28 11:19:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:37,340 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-04-28 11:19:37,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (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-28 11:19:37,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 128 transitions. [2022-04-28 11:19:37,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:19:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 11:19:37,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:37,478 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:37,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:37,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:19:37,694 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 13 times [2022-04-28 11:19:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:37,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589077293] [2022-04-28 11:19:37,929 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:37,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 14 times [2022-04-28 11:19:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:37,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759972884] [2022-04-28 11:19:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:37,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:37,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743458749] [2022-04-28 11:19:37,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:37,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:37,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:37,943 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-28 11:19:37,965 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-28 11:19:37,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:37,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:37,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 11:19:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:38,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:38,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:19:38,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#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); {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#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; {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:19:38,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:38,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:38,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:19:38,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,382 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:38,383 INFO L272 TraceCheckUtils]: 18: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:19:38,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,383 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:38,383 INFO L272 TraceCheckUtils]: 23: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:19:38,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,384 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:38,384 INFO L272 TraceCheckUtils]: 28: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:19:38,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,385 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:38,385 INFO L272 TraceCheckUtils]: 33: Hoare triple {10775#(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)); {10737#true} is VALID [2022-04-28 11:19:38,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,385 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {10775#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:38,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {10775#(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; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,386 INFO L272 TraceCheckUtils]: 40: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,387 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,387 INFO L272 TraceCheckUtils]: 45: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) 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)); {10737#true} is VALID [2022-04-28 11:19:38,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,388 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,388 INFO L272 TraceCheckUtils]: 50: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,388 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,388 INFO L272 TraceCheckUtils]: 55: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) 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)); {10737#true} is VALID [2022-04-28 11:19:38,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,389 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,389 INFO L272 TraceCheckUtils]: 60: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) 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)); {10737#true} is VALID [2022-04-28 11:19:38,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,390 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {10857#(and (= (+ main_~z~0 (- 6)) 6) (= (+ main_~z~0 (- 5)) 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; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !false; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,391 INFO L272 TraceCheckUtils]: 67: Hoare triple {10939#(and (= 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)); {10737#true} is VALID [2022-04-28 11:19:38,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,392 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #62#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,393 INFO L272 TraceCheckUtils]: 72: Hoare triple {10939#(and (= 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)); {10737#true} is VALID [2022-04-28 11:19:38,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,393 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,393 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #64#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,393 INFO L272 TraceCheckUtils]: 77: Hoare triple {10939#(and (= 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)); {10737#true} is VALID [2022-04-28 11:19:38,393 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,393 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,394 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #66#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,394 INFO L272 TraceCheckUtils]: 82: Hoare triple {10939#(and (= 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)); {10737#true} is VALID [2022-04-28 11:19:38,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,394 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,394 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,395 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #68#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,395 INFO L272 TraceCheckUtils]: 87: Hoare triple {10939#(and (= 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)); {10737#true} is VALID [2022-04-28 11:19:38,395 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,395 INFO L290 TraceCheckUtils]: 89: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,395 INFO L290 TraceCheckUtils]: 90: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,396 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10737#true} {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #70#return; {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:38,396 INFO L290 TraceCheckUtils]: 92: Hoare triple {10939#(and (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) 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; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:19:38,396 INFO L290 TraceCheckUtils]: 93: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} assume !false; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:19:38,397 INFO L272 TraceCheckUtils]: 94: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,397 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,397 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,397 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,397 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11021#(and (= main_~n~0 3) (= main_~y~0 37))} #62#return; {11021#(and (= main_~n~0 3) (= main_~y~0 37))} is VALID [2022-04-28 11:19:38,398 INFO L272 TraceCheckUtils]: 99: Hoare triple {11021#(and (= main_~n~0 3) (= main_~y~0 37))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:38,398 INFO L290 TraceCheckUtils]: 100: Hoare triple {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:38,398 INFO L290 TraceCheckUtils]: 101: Hoare triple {11047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:19:38,398 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:19:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:19:38,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:38,709 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:19:38,709 INFO L290 TraceCheckUtils]: 101: Hoare triple {11047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:19:38,709 INFO L290 TraceCheckUtils]: 100: Hoare triple {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:38,710 INFO L272 TraceCheckUtils]: 99: Hoare triple {11063#(= (+ (* 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)); {11043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:38,710 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10737#true} {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:38,710 INFO L290 TraceCheckUtils]: 97: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,711 INFO L290 TraceCheckUtils]: 96: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,711 INFO L290 TraceCheckUtils]: 95: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,711 INFO L272 TraceCheckUtils]: 94: Hoare triple {11063#(= (+ (* 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)); {10737#true} is VALID [2022-04-28 11:19:38,711 INFO L290 TraceCheckUtils]: 93: Hoare triple {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:38,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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; {11063#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:19:38,715 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:38,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,715 INFO L272 TraceCheckUtils]: 87: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {10737#true} is VALID [2022-04-28 11:19:38,716 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:38,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,716 INFO L272 TraceCheckUtils]: 82: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {10737#true} is VALID [2022-04-28 11:19:38,717 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:38,717 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,717 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,717 INFO L272 TraceCheckUtils]: 77: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,717 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:38,718 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,718 INFO L272 TraceCheckUtils]: 72: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {10737#true} is VALID [2022-04-28 11:19:38,718 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:38,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,719 INFO L272 TraceCheckUtils]: 67: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:38,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~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; {11085#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:19:38,722 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #70#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:19:38,722 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,723 INFO L272 TraceCheckUtils]: 60: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,723 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #68#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:19:38,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,723 INFO L272 TraceCheckUtils]: 55: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~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)); {10737#true} is VALID [2022-04-28 11:19:38,724 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #66#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:19:38,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,724 INFO L272 TraceCheckUtils]: 50: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,725 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #64#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:19:38,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,725 INFO L272 TraceCheckUtils]: 45: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,725 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #62#return; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:19:38,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,726 INFO L272 TraceCheckUtils]: 40: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} assume !false; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:19:38,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 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; {11167#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:19:38,730 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #70#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:19:38,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,731 INFO L272 TraceCheckUtils]: 33: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,731 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #68#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:19:38,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,732 INFO L272 TraceCheckUtils]: 28: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,732 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #66#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:19:38,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,732 INFO L272 TraceCheckUtils]: 23: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,733 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #64#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:19:38,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} #62#return; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:19:38,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} assume !false; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:19:38,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {10737#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11249#(= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18))} is VALID [2022-04-28 11:19:38,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#true} {10737#true} #60#return; {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#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; {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#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); {10737#true} is VALID [2022-04-28 11:19:38,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:19:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:19:38,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:38,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759972884] [2022-04-28 11:19:38,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:38,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743458749] [2022-04-28 11:19:38,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743458749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:38,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:38,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 11:19:38,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:38,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589077293] [2022-04-28 11:19:38,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589077293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:38,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:38,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:19:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783278203] [2022-04-28 11:19:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:38,737 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, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:19:38,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:38,738 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, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:19:38,785 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-28 11:19:38,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:19:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:19:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:19:38,786 INFO L87 Difference]: Start difference. First operand 115 states and 128 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, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:19:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:39,846 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2022-04-28 11:19:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:19:39,846 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, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:19:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:39,846 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, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:19:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-04-28 11:19:39,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, (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-28 11:19:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-04-28 11:19:39,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 112 transitions. [2022-04-28 11:19:39,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:39,952 INFO L225 Difference]: With dead ends: 142 [2022-04-28 11:19:39,952 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 11:19:39,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:19:39,953 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:39,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 270 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:19:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 11:19:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-04-28 11:19:40,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:40,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:19:40,031 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:19:40,031 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:19:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:40,034 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:19:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:19:40,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:40,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:40,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:19:40,034 INFO L87 Difference]: Start difference. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:19:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:40,037 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:19:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:19:40,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:40,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:40,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:40,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:19:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-04-28 11:19:40,039 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 103 [2022-04-28 11:19:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:40,040 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-04-28 11:19:40,040 INFO L496 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, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:19:40,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 142 transitions. [2022-04-28 11:19:40,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-04-28 11:19:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 11:19:40,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:40,249 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:40,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 11:19:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 11:19:40,450 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 3 times [2022-04-28 11:19:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:40,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1608251233] [2022-04-28 11:19:40,681 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:40,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 4 times [2022-04-28 11:19:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:40,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756541780] [2022-04-28 11:19:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:40,695 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:40,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407551170] [2022-04-28 11:19:40,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:40,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:40,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:40,696 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-28 11:19:40,697 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-28 11:19:40,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:40,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:40,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:19:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:40,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:41,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {12192#true} call ULTIMATE.init(); {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {12192#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); {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12192#true} {12192#true} #84#return; {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {12192#true} call #t~ret5 := main(); {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {12192#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; {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {12192#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,245 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12192#true} {12192#true} #60#return; {12192#true} is VALID [2022-04-28 11:19:41,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {12192#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:41,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:41,246 INFO L272 TraceCheckUtils]: 13: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:19:41,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,251 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:41,251 INFO L272 TraceCheckUtils]: 18: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:19:41,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,252 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:41,252 INFO L272 TraceCheckUtils]: 23: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:19:41,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,253 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:41,253 INFO L272 TraceCheckUtils]: 28: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:19:41,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,254 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:41,254 INFO L272 TraceCheckUtils]: 33: Hoare triple {12230#(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)); {12192#true} is VALID [2022-04-28 11:19:41,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,254 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12192#true} {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {12230#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:41,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {12230#(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; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:41,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:41,255 INFO L272 TraceCheckUtils]: 40: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,256 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:41,256 INFO L272 TraceCheckUtils]: 45: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {12192#true} is VALID [2022-04-28 11:19:41,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,257 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:41,257 INFO L272 TraceCheckUtils]: 50: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,257 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:41,258 INFO L272 TraceCheckUtils]: 55: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {12192#true} is VALID [2022-04-28 11:19:41,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,258 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:41,258 INFO L272 TraceCheckUtils]: 60: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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)); {12192#true} is VALID [2022-04-28 11:19:41,258 INFO L290 TraceCheckUtils]: 61: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,258 INFO L290 TraceCheckUtils]: 62: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,259 INFO L290 TraceCheckUtils]: 63: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,259 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12192#true} {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:19:41,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {12312#(and (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) 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; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:19:41,260 INFO L290 TraceCheckUtils]: 66: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} assume !false; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:19:41,260 INFO L272 TraceCheckUtils]: 67: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,260 INFO L290 TraceCheckUtils]: 68: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,260 INFO L290 TraceCheckUtils]: 69: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,260 INFO L290 TraceCheckUtils]: 70: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,261 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #62#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:19:41,261 INFO L272 TraceCheckUtils]: 72: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,261 INFO L290 TraceCheckUtils]: 74: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,261 INFO L290 TraceCheckUtils]: 75: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,261 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #64#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:19:41,261 INFO L272 TraceCheckUtils]: 77: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,261 INFO L290 TraceCheckUtils]: 78: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,262 INFO L290 TraceCheckUtils]: 79: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,262 INFO L290 TraceCheckUtils]: 80: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,262 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #66#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:19:41,262 INFO L272 TraceCheckUtils]: 82: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~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)); {12192#true} is VALID [2022-04-28 11:19:41,262 INFO L290 TraceCheckUtils]: 83: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,263 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #68#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:19:41,263 INFO L272 TraceCheckUtils]: 87: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~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)); {12192#true} is VALID [2022-04-28 11:19:41,263 INFO L290 TraceCheckUtils]: 88: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,263 INFO L290 TraceCheckUtils]: 90: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,264 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {12192#true} {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} #70#return; {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} is VALID [2022-04-28 11:19:41,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {12394#(and (<= main_~n~0 2) (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0))} assume !(~n~0 <= ~a~0); {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:19:41,265 INFO L272 TraceCheckUtils]: 93: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,265 INFO L290 TraceCheckUtils]: 94: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,265 INFO L290 TraceCheckUtils]: 95: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,265 INFO L290 TraceCheckUtils]: 96: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,265 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {12192#true} {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} #72#return; {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:19:41,266 INFO L272 TraceCheckUtils]: 98: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12192#true} is VALID [2022-04-28 11:19:41,266 INFO L290 TraceCheckUtils]: 99: Hoare triple {12192#true} ~cond := #in~cond; {12192#true} is VALID [2022-04-28 11:19:41,266 INFO L290 TraceCheckUtils]: 100: Hoare triple {12192#true} assume !(0 == ~cond); {12192#true} is VALID [2022-04-28 11:19:41,266 INFO L290 TraceCheckUtils]: 101: Hoare triple {12192#true} assume true; {12192#true} is VALID [2022-04-28 11:19:41,266 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12192#true} {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} #74#return; {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~0 2))} is VALID [2022-04-28 11:19:41,267 INFO L272 TraceCheckUtils]: 103: Hoare triple {12476#(and (= (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 11)) (= 6 (+ 5 main_~y~0 (* (- 1) main_~z~0))) (<= 1 main_~a~0) (< main_~a~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)); {12510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:41,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {12510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:41,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {12514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12193#false} is VALID [2022-04-28 11:19:41,268 INFO L290 TraceCheckUtils]: 106: Hoare triple {12193#false} assume !false; {12193#false} is VALID [2022-04-28 11:19:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:19:41,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756541780] [2022-04-28 11:19:44,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407551170] [2022-04-28 11:19:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407551170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:19:44,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:19:44,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:19:44,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1608251233] [2022-04-28 11:19:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1608251233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:44,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:44,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:19:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83736404] [2022-04-28 11:19:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:19:44,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:44,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:44,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:44,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:19:44,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:44,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:19:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:19:44,424 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:45,209 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 11:19:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:19:45,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:19:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:19:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:19:45,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:19:45,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:45,292 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:19:45,292 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 11:19:45,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:19:45,293 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:45,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:19:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 11:19:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 11:19:45,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:45,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:45,363 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:45,363 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:45,365 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:19:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:19:45,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:45,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:45,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:19:45,366 INFO L87 Difference]: Start difference. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:19:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:45,367 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:19:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:19:45,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:45,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:45,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:45,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:19:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-04-28 11:19:45,370 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 107 [2022-04-28 11:19:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:45,370 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-04-28 11:19:45,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:45,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 133 transitions. [2022-04-28 11:19:45,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:19:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 11:19:45,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:45,538 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:45,557 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-28 11:19:45,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:45,739 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 15 times [2022-04-28 11:19:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:45,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689140876] [2022-04-28 11:19:45,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:45,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 16 times [2022-04-28 11:19:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:45,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123933133] [2022-04-28 11:19:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:45,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:45,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486388908] [2022-04-28 11:19:45,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:45,966 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-28 11:19:45,966 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-28 11:19:46,009 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:46,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:46,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 11:19:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:46,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:46,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {13420#true} call ULTIMATE.init(); {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {13420#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); {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13420#true} {13420#true} #84#return; {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {13420#true} call #t~ret5 := main(); {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {13420#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; {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {13420#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13420#true} {13420#true} #60#return; {13420#true} is VALID [2022-04-28 11:19:46,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {13420#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:46,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:46,396 INFO L272 TraceCheckUtils]: 13: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:19:46,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,397 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:46,397 INFO L272 TraceCheckUtils]: 18: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:19:46,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,398 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:46,398 INFO L272 TraceCheckUtils]: 23: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:19:46,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,398 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:46,398 INFO L272 TraceCheckUtils]: 28: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:19:46,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,399 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:46,399 INFO L272 TraceCheckUtils]: 33: Hoare triple {13458#(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)); {13420#true} is VALID [2022-04-28 11:19:46,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,400 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13420#true} {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {13458#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:46,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {13458#(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; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:19:46,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !false; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:19:46,401 INFO L272 TraceCheckUtils]: 40: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,401 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #62#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:19:46,402 INFO L272 TraceCheckUtils]: 45: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,402 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #64#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:19:46,402 INFO L272 TraceCheckUtils]: 50: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,403 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #66#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:19:46,403 INFO L272 TraceCheckUtils]: 55: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,404 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #68#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:19:46,404 INFO L272 TraceCheckUtils]: 60: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,404 INFO L290 TraceCheckUtils]: 63: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,405 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13420#true} {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #70#return; {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-28 11:19:46,405 INFO L290 TraceCheckUtils]: 65: Hoare triple {13540#(and (= (+ (- 1) main_~x~0) 0) (= (+ 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; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:46,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} assume !false; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:46,405 INFO L272 TraceCheckUtils]: 67: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,406 INFO L290 TraceCheckUtils]: 70: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,406 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #62#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:46,406 INFO L272 TraceCheckUtils]: 72: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,406 INFO L290 TraceCheckUtils]: 74: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,406 INFO L290 TraceCheckUtils]: 75: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,407 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #64#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:46,407 INFO L272 TraceCheckUtils]: 77: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,407 INFO L290 TraceCheckUtils]: 79: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,407 INFO L290 TraceCheckUtils]: 80: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,408 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #66#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:46,408 INFO L272 TraceCheckUtils]: 82: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~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)); {13420#true} is VALID [2022-04-28 11:19:46,408 INFO L290 TraceCheckUtils]: 83: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,408 INFO L290 TraceCheckUtils]: 85: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,408 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #68#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:46,408 INFO L272 TraceCheckUtils]: 87: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,408 INFO L290 TraceCheckUtils]: 88: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,409 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13420#true} {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} #70#return; {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:46,409 INFO L290 TraceCheckUtils]: 92: Hoare triple {13622#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0) (= main_~x~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; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:19:46,410 INFO L290 TraceCheckUtils]: 93: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} assume !false; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:19:46,410 INFO L272 TraceCheckUtils]: 94: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,410 INFO L290 TraceCheckUtils]: 95: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,410 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13420#true} {13704#(and (= main_~n~0 3) (= main_~x~0 27))} #62#return; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:19:46,411 INFO L272 TraceCheckUtils]: 99: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,411 INFO L290 TraceCheckUtils]: 101: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,411 INFO L290 TraceCheckUtils]: 102: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,411 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13420#true} {13704#(and (= main_~n~0 3) (= main_~x~0 27))} #64#return; {13704#(and (= main_~n~0 3) (= main_~x~0 27))} is VALID [2022-04-28 11:19:46,412 INFO L272 TraceCheckUtils]: 104: Hoare triple {13704#(and (= main_~n~0 3) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:46,412 INFO L290 TraceCheckUtils]: 105: Hoare triple {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13745#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:46,412 INFO L290 TraceCheckUtils]: 106: Hoare triple {13745#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13421#false} is VALID [2022-04-28 11:19:46,412 INFO L290 TraceCheckUtils]: 107: Hoare triple {13421#false} assume !false; {13421#false} is VALID [2022-04-28 11:19:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 34 proven. 33 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:19:46,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:46,740 INFO L290 TraceCheckUtils]: 107: Hoare triple {13421#false} assume !false; {13421#false} is VALID [2022-04-28 11:19:46,741 INFO L290 TraceCheckUtils]: 106: Hoare triple {13745#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13421#false} is VALID [2022-04-28 11:19:46,741 INFO L290 TraceCheckUtils]: 105: Hoare triple {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13745#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:46,742 INFO L272 TraceCheckUtils]: 104: Hoare triple {13761#(= (* 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)); {13741#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:46,742 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13420#true} {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:46,742 INFO L290 TraceCheckUtils]: 102: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,742 INFO L290 TraceCheckUtils]: 101: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,742 INFO L290 TraceCheckUtils]: 100: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,743 INFO L272 TraceCheckUtils]: 99: Hoare triple {13761#(= (* 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)); {13420#true} is VALID [2022-04-28 11:19:46,743 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13420#true} {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:46,743 INFO L290 TraceCheckUtils]: 97: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,743 INFO L290 TraceCheckUtils]: 96: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,743 INFO L290 TraceCheckUtils]: 95: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,743 INFO L272 TraceCheckUtils]: 94: Hoare triple {13761#(= (* 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)); {13420#true} is VALID [2022-04-28 11:19:46,744 INFO L290 TraceCheckUtils]: 93: Hoare triple {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:46,745 INFO L290 TraceCheckUtils]: 92: Hoare triple {13798#(= (* (+ 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; {13761#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:46,746 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:46,746 INFO L290 TraceCheckUtils]: 90: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,746 INFO L290 TraceCheckUtils]: 89: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,746 INFO L290 TraceCheckUtils]: 88: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,746 INFO L272 TraceCheckUtils]: 87: Hoare triple {13798#(= (* (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,747 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:46,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,747 INFO L290 TraceCheckUtils]: 84: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,747 INFO L290 TraceCheckUtils]: 83: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,747 INFO L272 TraceCheckUtils]: 82: Hoare triple {13798#(= (* (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,747 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:46,747 INFO L290 TraceCheckUtils]: 80: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,748 INFO L272 TraceCheckUtils]: 77: Hoare triple {13798#(= (* (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,748 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:46,748 INFO L290 TraceCheckUtils]: 75: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,748 INFO L290 TraceCheckUtils]: 74: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,748 INFO L272 TraceCheckUtils]: 72: Hoare triple {13798#(= (* (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,749 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13420#true} {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:46,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,749 INFO L272 TraceCheckUtils]: 67: Hoare triple {13798#(= (* (+ 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)); {13420#true} is VALID [2022-04-28 11:19:46,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:46,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {13798#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:46,774 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:46,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,774 INFO L272 TraceCheckUtils]: 60: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,774 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:46,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,775 INFO L272 TraceCheckUtils]: 55: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {13420#true} is VALID [2022-04-28 11:19:46,775 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:46,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,776 INFO L272 TraceCheckUtils]: 50: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,776 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:46,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,776 INFO L272 TraceCheckUtils]: 45: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,777 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13420#true} {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:46,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,777 INFO L272 TraceCheckUtils]: 40: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:46,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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; {13880#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:46,780 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #70#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:46,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,780 INFO L272 TraceCheckUtils]: 33: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,781 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #68#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:46,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,781 INFO L272 TraceCheckUtils]: 28: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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)); {13420#true} is VALID [2022-04-28 11:19:46,781 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #66#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:46,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,782 INFO L272 TraceCheckUtils]: 23: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,782 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #64#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:46,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,782 INFO L272 TraceCheckUtils]: 18: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,795 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13420#true} {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #62#return; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:46,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,796 INFO L272 TraceCheckUtils]: 13: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !false; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:46,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {13420#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13962#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:46,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13420#true} {13420#true} #60#return; {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {13420#true} assume !(0 == ~cond); {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {13420#true} ~cond := #in~cond; {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {13420#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {13420#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; {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {13420#true} call #t~ret5 := main(); {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13420#true} {13420#true} #84#return; {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {13420#true} assume true; {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {13420#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); {13420#true} is VALID [2022-04-28 11:19:46,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {13420#true} call ULTIMATE.init(); {13420#true} is VALID [2022-04-28 11:19:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 34 proven. 33 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:19:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:46,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123933133] [2022-04-28 11:19:46,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:46,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486388908] [2022-04-28 11:19:46,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486388908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:46,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:46,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 11:19:46,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:46,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689140876] [2022-04-28 11:19:46,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689140876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:46,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:46,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:19:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166517499] [2022-04-28 11:19:46,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:46,799 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 108 [2022-04-28 11:19:46,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:46,799 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:46,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:46,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:19:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:46,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:19:46,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:19:46,848 INFO L87 Difference]: Start difference. First operand 123 states and 133 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:48,274 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-04-28 11:19:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:19:48,275 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 108 [2022-04-28 11:19:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:48,275 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-04-28 11:19:48,276 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-04-28 11:19:48,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 106 transitions. [2022-04-28 11:19:48,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:48,397 INFO L225 Difference]: With dead ends: 139 [2022-04-28 11:19:48,397 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 11:19:48,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:19:48,397 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:48,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 259 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:19:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 11:19:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2022-04-28 11:19:48,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:48,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:19:48,478 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:19:48,478 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:19:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:48,480 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:19:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:19:48,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:48,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:48,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:19:48,481 INFO L87 Difference]: Start difference. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:19:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:48,483 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:19:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:19:48,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:48,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:48,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:48,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:19:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-04-28 11:19:48,485 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 108 [2022-04-28 11:19:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:48,486 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-04-28 11:19:48,486 INFO L496 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:19:48,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 138 transitions. [2022-04-28 11:19:48,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-04-28 11:19:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 11:19:48,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:48,640 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:48,656 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-28 11:19:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 11:19:48,852 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 17 times [2022-04-28 11:19:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531308625] [2022-04-28 11:19:49,082 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:49,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 18 times [2022-04-28 11:19:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:49,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497904504] [2022-04-28 11:19:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:49,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410571194] [2022-04-28 11:19:49,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:19:49,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:49,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:49,100 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-28 11:19:49,101 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-28 11:19:49,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:19:49,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:49,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:19:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:49,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:00,005 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((aux_div_v_main_~z~0_BEFORE_CALL_269_35 Int)) (not (let ((.cse0 (* 3 aux_div_v_main_~z~0_BEFORE_CALL_269_35 aux_div_v_main_~z~0_BEFORE_CALL_269_35))) (= (+ (* 12 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* 6 (* (+ (* (- 3) aux_div_v_main_~z~0_BEFORE_CALL_269_35) .cse0 1) aux_div_v_main_~z~0_BEFORE_CALL_269_35))) (+ (* (let ((.cse1 (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (- 6)) 6))) (* .cse1 .cse1 .cse1)) 18) (* (- 36) aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* .cse0 12) 18))))) (<= 0 |c___VERIFIER_assert_#in~cond|)) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from false [2022-04-28 11:20:05,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {14889#true} call ULTIMATE.init(); {14889#true} is VALID [2022-04-28 11:20:05,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {14889#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); {14889#true} is VALID [2022-04-28 11:20:05,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14889#true} {14889#true} #84#return; {14889#true} is VALID [2022-04-28 11:20:05,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {14889#true} call #t~ret5 := main(); {14889#true} is VALID [2022-04-28 11:20:05,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {14889#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; {14889#true} is VALID [2022-04-28 11:20:05,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {14889#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14889#true} {14889#true} #60#return; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {14889#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L272 TraceCheckUtils]: 13: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L272 TraceCheckUtils]: 18: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L272 TraceCheckUtils]: 23: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L272 TraceCheckUtils]: 28: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:20:05,272 INFO L272 TraceCheckUtils]: 33: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {14889#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; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L272 TraceCheckUtils]: 40: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L272 TraceCheckUtils]: 45: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L272 TraceCheckUtils]: 50: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L272 TraceCheckUtils]: 55: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L272 TraceCheckUtils]: 60: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,274 INFO L290 TraceCheckUtils]: 62: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {14889#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; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L272 TraceCheckUtils]: 67: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 69: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 70: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L272 TraceCheckUtils]: 72: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 73: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 74: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,275 INFO L290 TraceCheckUtils]: 75: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L272 TraceCheckUtils]: 77: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L290 TraceCheckUtils]: 79: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L290 TraceCheckUtils]: 80: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L272 TraceCheckUtils]: 82: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L290 TraceCheckUtils]: 83: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L290 TraceCheckUtils]: 84: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L290 TraceCheckUtils]: 85: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:20:05,276 INFO L272 TraceCheckUtils]: 87: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,277 INFO L290 TraceCheckUtils]: 88: Hoare triple {14889#true} ~cond := #in~cond; {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:05,277 INFO L290 TraceCheckUtils]: 89: Hoare triple {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:05,277 INFO L290 TraceCheckUtils]: 90: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:05,278 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {14889#true} #70#return; {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:20:05,280 INFO L290 TraceCheckUtils]: 92: Hoare triple {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:20:05,280 INFO L290 TraceCheckUtils]: 93: Hoare triple {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} assume !false; {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:20:05,280 INFO L272 TraceCheckUtils]: 94: Hoare triple {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,280 INFO L290 TraceCheckUtils]: 95: Hoare triple {14889#true} ~cond := #in~cond; {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:05,281 INFO L290 TraceCheckUtils]: 96: Hoare triple {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:05,281 INFO L290 TraceCheckUtils]: 97: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:05,282 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15169#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} #62#return; {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:20:05,282 INFO L272 TraceCheckUtils]: 99: Hoare triple {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* 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)); {14889#true} is VALID [2022-04-28 11:20:05,282 INFO L290 TraceCheckUtils]: 100: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:20:05,282 INFO L290 TraceCheckUtils]: 101: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:20:05,282 INFO L290 TraceCheckUtils]: 102: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:20:05,282 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14889#true} {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #64#return; {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:20:05,283 INFO L272 TraceCheckUtils]: 104: Hoare triple {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:20:05,283 INFO L290 TraceCheckUtils]: 105: Hoare triple {14889#true} ~cond := #in~cond; {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:05,283 INFO L290 TraceCheckUtils]: 106: Hoare triple {15158#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:05,283 INFO L290 TraceCheckUtils]: 107: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:07,285 WARN L284 TraceCheckUtils]: 108: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15191#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #66#return; {15222#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} is UNKNOWN [2022-04-28 11:20:07,619 INFO L272 TraceCheckUtils]: 109: Hoare triple {15222#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15226#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~z~0_BEFORE_CALL_269_35 Int)) (not (= (+ (* 12 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* 6 (* (+ (* (- 3) aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* 3 aux_div_v_main_~z~0_BEFORE_CALL_269_35 aux_div_v_main_~z~0_BEFORE_CALL_269_35) 1) aux_div_v_main_~z~0_BEFORE_CALL_269_35))) (+ (* (* (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (- 6)) 6)) 18) (* (- 36) aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* (* 3 aux_div_v_main_~z~0_BEFORE_CALL_269_35 aux_div_v_main_~z~0_BEFORE_CALL_269_35) 12) 18))))) (<= 1 |__VERIFIER_assert_#in~cond|))} is VALID [2022-04-28 11:20:09,621 WARN L290 TraceCheckUtils]: 110: Hoare triple {15226#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~z~0_BEFORE_CALL_269_35 Int)) (not (= (+ (* 12 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* 6 (* (+ (* (- 3) aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* 3 aux_div_v_main_~z~0_BEFORE_CALL_269_35 aux_div_v_main_~z~0_BEFORE_CALL_269_35) 1) aux_div_v_main_~z~0_BEFORE_CALL_269_35))) (+ (* (* (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_269_35) (- 6)) 6)) 18) (* (- 36) aux_div_v_main_~z~0_BEFORE_CALL_269_35) (* (* 3 aux_div_v_main_~z~0_BEFORE_CALL_269_35 aux_div_v_main_~z~0_BEFORE_CALL_269_35) 12) 18))))) (<= 1 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {15230#(<= 1 __VERIFIER_assert_~cond)} is UNKNOWN [2022-04-28 11:20:09,627 INFO L290 TraceCheckUtils]: 111: Hoare triple {15230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14890#false} is VALID [2022-04-28 11:20:09,627 INFO L290 TraceCheckUtils]: 112: Hoare triple {14890#false} assume !false; {14890#false} is VALID [2022-04-28 11:20:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:20:09,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:02,642 INFO L290 TraceCheckUtils]: 112: Hoare triple {14890#false} assume !false; {14890#false} is VALID [2022-04-28 11:22:02,642 INFO L290 TraceCheckUtils]: 111: Hoare triple {15230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14890#false} is VALID [2022-04-28 11:22:02,643 INFO L290 TraceCheckUtils]: 110: Hoare triple {15243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:02,643 INFO L272 TraceCheckUtils]: 109: Hoare triple {15247#(= (+ (* 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)); {15243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:02,644 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15251#(= (+ (* 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)))} #66#return; {15247#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:22:02,644 INFO L290 TraceCheckUtils]: 107: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:02,645 INFO L290 TraceCheckUtils]: 106: Hoare triple {15261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:02,645 INFO L290 TraceCheckUtils]: 105: Hoare triple {14889#true} ~cond := #in~cond; {15261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:02,645 INFO L272 TraceCheckUtils]: 104: Hoare triple {15251#(= (+ (* 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)); {14889#true} is VALID [2022-04-28 11:22:02,646 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14889#true} {15251#(= (+ (* 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)))} #64#return; {15251#(= (+ (* 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-28 11:22:02,646 INFO L290 TraceCheckUtils]: 102: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:02,646 INFO L290 TraceCheckUtils]: 101: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:02,646 INFO L290 TraceCheckUtils]: 100: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:02,646 INFO L272 TraceCheckUtils]: 99: Hoare triple {15251#(= (+ (* 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)); {14889#true} is VALID [2022-04-28 11:22:02,646 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {15283#(or (not (= (+ (* main_~n~0 6) 6) main_~z~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))))} #62#return; {15251#(= (+ (* 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-28 11:22:02,647 INFO L290 TraceCheckUtils]: 97: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:02,647 INFO L290 TraceCheckUtils]: 96: Hoare triple {15261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:02,647 INFO L290 TraceCheckUtils]: 95: Hoare triple {14889#true} ~cond := #in~cond; {15261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:02,647 INFO L272 TraceCheckUtils]: 94: Hoare triple {15283#(or (not (= (+ (* main_~n~0 6) 6) main_~z~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)); {14889#true} is VALID [2022-04-28 11:22:02,648 INFO L290 TraceCheckUtils]: 93: Hoare triple {15283#(or (not (= (+ (* main_~n~0 6) 6) main_~z~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 !false; {15283#(or (not (= (+ (* main_~n~0 6) 6) main_~z~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-28 11:22:04,101 INFO L290 TraceCheckUtils]: 92: Hoare triple {15302#(or (not (= (mod main_~z~0 6) 0)) (= (+ (* (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12) (+ main_~z~0 main_~y~0)) (* (div (+ main_~z~0 (- 6)) 6) 12) 24) (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~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; {15283#(or (not (= (+ (* main_~n~0 6) 6) main_~z~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-28 11:22:06,104 WARN L284 TraceCheckUtils]: 91: Hoare quadruple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} {14889#true} #70#return; {15302#(or (not (= (mod main_~z~0 6) 0)) (= (+ (* (+ (* (div (+ main_~z~0 (- 6)) 6) 6) 12) (+ main_~z~0 main_~y~0)) (* (div (+ main_~z~0 (- 6)) 6) 12) 24) (+ (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 18) (* main_~y~0 12) 6 (* main_~z~0 12))))} is UNKNOWN [2022-04-28 11:22:06,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:06,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {15261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15162#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:06,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {14889#true} ~cond := #in~cond; {15261#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:06,105 INFO L272 TraceCheckUtils]: 87: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L290 TraceCheckUtils]: 85: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L290 TraceCheckUtils]: 84: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L290 TraceCheckUtils]: 83: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L272 TraceCheckUtils]: 82: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L290 TraceCheckUtils]: 80: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,105 INFO L290 TraceCheckUtils]: 79: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L272 TraceCheckUtils]: 77: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 73: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L272 TraceCheckUtils]: 72: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 69: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 68: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L272 TraceCheckUtils]: 67: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 66: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {14889#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; {14889#true} is VALID [2022-04-28 11:22:06,106 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L272 TraceCheckUtils]: 60: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L272 TraceCheckUtils]: 55: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,107 INFO L272 TraceCheckUtils]: 50: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L272 TraceCheckUtils]: 45: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L272 TraceCheckUtils]: 40: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {14889#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; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14889#true} {14889#true} #70#return; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L272 TraceCheckUtils]: 33: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14889#true} {14889#true} #68#return; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L272 TraceCheckUtils]: 28: Hoare triple {14889#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14889#true} {14889#true} #66#return; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L272 TraceCheckUtils]: 23: Hoare triple {14889#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14889#true} {14889#true} #64#return; {14889#true} is VALID [2022-04-28 11:22:06,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L272 TraceCheckUtils]: 18: Hoare triple {14889#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14889#true} {14889#true} #62#return; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L272 TraceCheckUtils]: 13: Hoare triple {14889#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {14889#true} assume !false; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {14889#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14889#true} {14889#true} #60#return; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {14889#true} assume !(0 == ~cond); {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {14889#true} ~cond := #in~cond; {14889#true} is VALID [2022-04-28 11:22:06,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {14889#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {14889#true} is VALID [2022-04-28 11:22:06,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {14889#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; {14889#true} is VALID [2022-04-28 11:22:06,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {14889#true} call #t~ret5 := main(); {14889#true} is VALID [2022-04-28 11:22:06,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14889#true} {14889#true} #84#return; {14889#true} is VALID [2022-04-28 11:22:06,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {14889#true} assume true; {14889#true} is VALID [2022-04-28 11:22:06,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {14889#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); {14889#true} is VALID [2022-04-28 11:22:06,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {14889#true} call ULTIMATE.init(); {14889#true} is VALID [2022-04-28 11:22:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:22:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:06,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497904504] [2022-04-28 11:22:06,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:06,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410571194] [2022-04-28 11:22:06,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410571194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:06,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:06,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2022-04-28 11:22:06,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:06,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531308625] [2022-04-28 11:22:06,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531308625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:06,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:06,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:22:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844372923] [2022-04-28 11:22:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:06,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:22:06,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:06,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:22:10,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:10,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:22:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:10,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:22:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=143, Unknown=3, NotChecked=24, Total=210 [2022-04-28 11:22:10,787 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:22:14,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:16,988 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-28 11:22:18,991 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-28 11:22:20,994 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-28 11:22:22,996 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-28 11:22:27,022 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-28 11:22:29,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:31,147 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-28 11:22:33,152 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-28 11:22:34,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:36,883 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-28 11:22:41,267 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-28 11:22:43,271 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-28 11:22:45,273 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-28 11:22:48,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:50,548 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-28 11:22:54,619 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-28 11:22:56,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:22:59,680 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-28 11:23:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:00,326 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-04-28 11:23:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:23:00,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:23:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:23:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 11:23:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:23:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 11:23:00,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 11:23:04,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 54 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:04,467 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:23:04,467 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:23:04,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=62, Invalid=211, Unknown=3, NotChecked=30, Total=306 [2022-04-28 11:23:04,467 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 32 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 36.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:04,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 122 Invalid, 15 Unknown, 39 Unchecked, 36.8s Time] [2022-04-28 11:23:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:23:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 11:23:04,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:04,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:04,561 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:04,561 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:04,563 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-04-28 11:23:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-04-28 11:23:04,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:04,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:04,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 134 states. [2022-04-28 11:23:04,564 INFO L87 Difference]: Start difference. First operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 134 states. [2022-04-28 11:23:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:04,565 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-04-28 11:23:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-04-28 11:23:04,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:04,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:04,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:04,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2022-04-28 11:23:04,568 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 113 [2022-04-28 11:23:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:04,568 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2022-04-28 11:23:04,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:23:04,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 143 transitions. [2022-04-28 11:23:09,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 141 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-04-28 11:23:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:23:09,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:09,163 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 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, 1, 1, 1, 1] [2022-04-28 11:23:09,170 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-28 11:23:09,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 11:23:09,364 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 5 times [2022-04-28 11:23:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:09,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920296047] [2022-04-28 11:23:09,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:09,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 6 times [2022-04-28 11:23:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:09,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296316110] [2022-04-28 11:23:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:09,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:09,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514835051] [2022-04-28 11:23:09,618 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:23:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:09,619 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-28 11:23:09,620 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-28 11:23:10,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:23:10,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:10,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:23:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:10,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:13,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {16397#true} call ULTIMATE.init(); {16397#true} is VALID [2022-04-28 11:23:13,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {16397#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); {16397#true} is VALID [2022-04-28 11:23:13,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16397#true} {16397#true} #84#return; {16397#true} is VALID [2022-04-28 11:23:13,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {16397#true} call #t~ret5 := main(); {16397#true} is VALID [2022-04-28 11:23:13,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {16397#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; {16397#true} is VALID [2022-04-28 11:23:13,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {16397#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {16397#true} ~cond := #in~cond; {16423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:23:13,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {16423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:13,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {16427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:13,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16427#(not (= |assume_abort_if_not_#in~cond| 0))} {16397#true} #60#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} assume !false; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,473 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #62#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,473 INFO L272 TraceCheckUtils]: 18: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,473 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #64#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,474 INFO L272 TraceCheckUtils]: 23: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,474 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #66#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,474 INFO L272 TraceCheckUtils]: 28: Hoare triple {16434#(and (<= main_~a~0 50) (<= 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)); {16397#true} is VALID [2022-04-28 11:23:13,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,475 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #68#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,475 INFO L272 TraceCheckUtils]: 33: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,476 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #70#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 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; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} assume !false; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,476 INFO L272 TraceCheckUtils]: 40: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,477 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #62#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,477 INFO L272 TraceCheckUtils]: 45: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,478 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #64#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,478 INFO L272 TraceCheckUtils]: 50: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,478 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #66#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,478 INFO L272 TraceCheckUtils]: 55: Hoare triple {16434#(and (<= main_~a~0 50) (<= 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)); {16397#true} is VALID [2022-04-28 11:23:13,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,479 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #68#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,479 INFO L272 TraceCheckUtils]: 60: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,479 INFO L290 TraceCheckUtils]: 61: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,480 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #70#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,480 INFO L290 TraceCheckUtils]: 65: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 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; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,480 INFO L290 TraceCheckUtils]: 66: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} assume !false; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,480 INFO L272 TraceCheckUtils]: 67: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,480 INFO L290 TraceCheckUtils]: 68: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,480 INFO L290 TraceCheckUtils]: 69: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,481 INFO L290 TraceCheckUtils]: 70: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,481 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #62#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,481 INFO L272 TraceCheckUtils]: 72: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,482 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #64#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,482 INFO L272 TraceCheckUtils]: 77: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,482 INFO L290 TraceCheckUtils]: 78: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,482 INFO L290 TraceCheckUtils]: 80: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,482 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #66#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,482 INFO L272 TraceCheckUtils]: 82: Hoare triple {16434#(and (<= main_~a~0 50) (<= 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)); {16397#true} is VALID [2022-04-28 11:23:13,482 INFO L290 TraceCheckUtils]: 83: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,483 INFO L290 TraceCheckUtils]: 84: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,483 INFO L290 TraceCheckUtils]: 85: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,483 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #68#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,483 INFO L272 TraceCheckUtils]: 87: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,483 INFO L290 TraceCheckUtils]: 88: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,483 INFO L290 TraceCheckUtils]: 89: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,483 INFO L290 TraceCheckUtils]: 90: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,484 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16397#true} {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #70#return; {16434#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {16434#(and (<= main_~a~0 50) (<= 0 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; {16681#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,485 INFO L290 TraceCheckUtils]: 93: Hoare triple {16681#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (<= 0 main_~a~0))} assume !false; {16681#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,485 INFO L272 TraceCheckUtils]: 94: Hoare triple {16681#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,485 INFO L290 TraceCheckUtils]: 95: Hoare triple {16397#true} ~cond := #in~cond; {16691#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:13,486 INFO L290 TraceCheckUtils]: 96: Hoare triple {16691#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:13,486 INFO L290 TraceCheckUtils]: 97: Hoare triple {16695#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:13,486 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16695#(not (= |__VERIFIER_assert_#in~cond| 0))} {16681#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (<= 0 main_~a~0))} #62#return; {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,486 INFO L272 TraceCheckUtils]: 99: Hoare triple {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,487 INFO L290 TraceCheckUtils]: 100: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,487 INFO L290 TraceCheckUtils]: 101: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,487 INFO L290 TraceCheckUtils]: 102: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,487 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16397#true} {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,487 INFO L272 TraceCheckUtils]: 104: Hoare triple {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,487 INFO L290 TraceCheckUtils]: 105: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,487 INFO L290 TraceCheckUtils]: 106: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,487 INFO L290 TraceCheckUtils]: 107: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,488 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16397#true} {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,488 INFO L272 TraceCheckUtils]: 109: Hoare triple {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 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)); {16397#true} is VALID [2022-04-28 11:23:13,488 INFO L290 TraceCheckUtils]: 110: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,488 INFO L290 TraceCheckUtils]: 111: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,488 INFO L290 TraceCheckUtils]: 112: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,489 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16397#true} {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,489 INFO L272 TraceCheckUtils]: 114: Hoare triple {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16397#true} is VALID [2022-04-28 11:23:13,489 INFO L290 TraceCheckUtils]: 115: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,489 INFO L290 TraceCheckUtils]: 116: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,489 INFO L290 TraceCheckUtils]: 117: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,489 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {16397#true} {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:13,490 INFO L290 TraceCheckUtils]: 119: Hoare triple {16702#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {16766#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:23:13,490 INFO L272 TraceCheckUtils]: 120: Hoare triple {16766#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 50) (<= 0 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)); {16397#true} is VALID [2022-04-28 11:23:13,490 INFO L290 TraceCheckUtils]: 121: Hoare triple {16397#true} ~cond := #in~cond; {16397#true} is VALID [2022-04-28 11:23:13,490 INFO L290 TraceCheckUtils]: 122: Hoare triple {16397#true} assume !(0 == ~cond); {16397#true} is VALID [2022-04-28 11:23:13,491 INFO L290 TraceCheckUtils]: 123: Hoare triple {16397#true} assume true; {16397#true} is VALID [2022-04-28 11:23:13,491 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16397#true} {16766#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {16766#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:23:14,028 INFO L272 TraceCheckUtils]: 125: Hoare triple {16766#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 50) (<= 0 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)); {16785#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:14,029 INFO L290 TraceCheckUtils]: 126: Hoare triple {16785#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16789#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:14,029 INFO L290 TraceCheckUtils]: 127: Hoare triple {16789#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16398#false} is VALID [2022-04-28 11:23:14,029 INFO L290 TraceCheckUtils]: 128: Hoare triple {16398#false} assume !false; {16398#false} is VALID [2022-04-28 11:23:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-28 11:23:14,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:14,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:14,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296316110] [2022-04-28 11:23:14,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:14,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514835051] [2022-04-28 11:23:14,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514835051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:23:14,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:23:14,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 11:23:14,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:14,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920296047] [2022-04-28 11:23:14,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920296047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:14,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:14,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:23:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349329584] [2022-04-28 11:23:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-28 11:23:14,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:14,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:23:16,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:16,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:23:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:23:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:23:16,624 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:23:22,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:23:24,293 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-28 11:23:26,297 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-28 11:23:28,965 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-28 11:23:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:32,833 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-04-28 11:23:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:23:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-28 11:23:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:23:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:23:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:23:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:23:32,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-28 11:23:32,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:32,899 INFO L225 Difference]: With dead ends: 140 [2022-04-28 11:23:32,899 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 11:23:32,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:23:32,900 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:32,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 194 Invalid, 3 Unknown, 0 Unchecked, 9.8s Time] [2022-04-28 11:23:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 11:23:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-28 11:23:33,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:33,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:33,041 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:33,041 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:33,043 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-04-28 11:23:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-04-28 11:23:33,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:33,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:33,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 138 states. [2022-04-28 11:23:33,044 INFO L87 Difference]: Start difference. First operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 138 states. [2022-04-28 11:23:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:33,046 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-04-28 11:23:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-04-28 11:23:33,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:33,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:33,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:33,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-04-28 11:23:33,048 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 129 [2022-04-28 11:23:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:33,048 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-04-28 11:23:33,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:23:33,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 146 transitions. [2022-04-28 11:23:37,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 145 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-04-28 11:23:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 11:23:37,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:37,463 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:37,470 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-28 11:23:37,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:37,668 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:37,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 5 times [2022-04-28 11:23:37,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:37,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436398347] [2022-04-28 11:23:37,897 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:37,897 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 6 times [2022-04-28 11:23:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312082100] [2022-04-28 11:23:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:37,905 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:37,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275838496] [2022-04-28 11:23:37,906 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:23:37,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:37,921 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-28 11:23:37,923 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-28 11:23:39,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:23:39,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:39,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 11:23:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:39,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:49,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {17651#true} call ULTIMATE.init(); {17651#true} is VALID [2022-04-28 11:23:49,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {17651#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); {17651#true} is VALID [2022-04-28 11:23:49,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17651#true} {17651#true} #84#return; {17651#true} is VALID [2022-04-28 11:23:49,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {17651#true} call #t~ret5 := main(); {17651#true} is VALID [2022-04-28 11:23:49,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {17651#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; {17651#true} is VALID [2022-04-28 11:23:49,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {17651#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {17651#true} ~cond := #in~cond; {17677#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:23:49,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {17677#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17681#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:49,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {17681#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17681#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:49,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17681#(not (= |assume_abort_if_not_#in~cond| 0))} {17651#true} #60#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} assume !false; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,724 INFO L272 TraceCheckUtils]: 13: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,725 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #62#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,725 INFO L272 TraceCheckUtils]: 18: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,725 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #64#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,725 INFO L272 TraceCheckUtils]: 23: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,726 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #66#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,726 INFO L272 TraceCheckUtils]: 28: Hoare triple {17688#(and (<= main_~a~0 50) (<= 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)); {17651#true} is VALID [2022-04-28 11:23:49,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,727 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #68#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,727 INFO L272 TraceCheckUtils]: 33: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,727 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #70#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 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; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} assume !false; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,728 INFO L272 TraceCheckUtils]: 40: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,729 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #62#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,729 INFO L272 TraceCheckUtils]: 45: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,729 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #64#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,729 INFO L272 TraceCheckUtils]: 50: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,730 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #66#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,730 INFO L272 TraceCheckUtils]: 55: Hoare triple {17688#(and (<= main_~a~0 50) (<= 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)); {17651#true} is VALID [2022-04-28 11:23:49,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,731 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17651#true} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #68#return; {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,731 INFO L272 TraceCheckUtils]: 60: Hoare triple {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {17651#true} ~cond := #in~cond; {17842#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:49,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {17842#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,732 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} {17688#(and (<= main_~a~0 50) (<= 0 main_~a~0))} #70#return; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 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; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,735 INFO L290 TraceCheckUtils]: 66: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !false; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,735 INFO L272 TraceCheckUtils]: 67: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,735 INFO L290 TraceCheckUtils]: 68: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,735 INFO L290 TraceCheckUtils]: 69: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,735 INFO L290 TraceCheckUtils]: 70: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,735 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17651#true} {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #62#return; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,735 INFO L272 TraceCheckUtils]: 72: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,736 INFO L290 TraceCheckUtils]: 75: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,743 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17651#true} {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #64#return; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,743 INFO L272 TraceCheckUtils]: 77: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,743 INFO L290 TraceCheckUtils]: 79: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,744 INFO L290 TraceCheckUtils]: 80: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,744 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17651#true} {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #66#return; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,744 INFO L272 TraceCheckUtils]: 82: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 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)); {17651#true} is VALID [2022-04-28 11:23:49,744 INFO L290 TraceCheckUtils]: 83: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,744 INFO L290 TraceCheckUtils]: 84: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,744 INFO L290 TraceCheckUtils]: 85: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,745 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17651#true} {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #68#return; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,745 INFO L272 TraceCheckUtils]: 87: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,745 INFO L290 TraceCheckUtils]: 88: Hoare triple {17651#true} ~cond := #in~cond; {17842#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:49,745 INFO L290 TraceCheckUtils]: 89: Hoare triple {17842#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,746 INFO L290 TraceCheckUtils]: 90: Hoare triple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,746 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #70#return; {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,748 INFO L290 TraceCheckUtils]: 92: Hoare triple {17853#(and (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 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; {17938#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,748 INFO L290 TraceCheckUtils]: 93: Hoare triple {17938#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0))} assume !false; {17938#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,749 INFO L272 TraceCheckUtils]: 94: Hoare triple {17938#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,749 INFO L290 TraceCheckUtils]: 95: Hoare triple {17651#true} ~cond := #in~cond; {17842#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:49,749 INFO L290 TraceCheckUtils]: 96: Hoare triple {17842#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,749 INFO L290 TraceCheckUtils]: 97: Hoare triple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,750 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} {17938#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0))} #62#return; {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,750 INFO L272 TraceCheckUtils]: 99: Hoare triple {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,750 INFO L290 TraceCheckUtils]: 100: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,750 INFO L290 TraceCheckUtils]: 101: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,750 INFO L290 TraceCheckUtils]: 102: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,751 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17651#true} {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,751 INFO L272 TraceCheckUtils]: 104: Hoare triple {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,751 INFO L290 TraceCheckUtils]: 105: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,751 INFO L290 TraceCheckUtils]: 106: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,751 INFO L290 TraceCheckUtils]: 107: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,752 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17651#true} {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,752 INFO L272 TraceCheckUtils]: 109: Hoare triple {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 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)); {17651#true} is VALID [2022-04-28 11:23:49,752 INFO L290 TraceCheckUtils]: 110: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,752 INFO L290 TraceCheckUtils]: 111: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,752 INFO L290 TraceCheckUtils]: 112: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,752 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17651#true} {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,753 INFO L272 TraceCheckUtils]: 114: Hoare triple {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:23:49,753 INFO L290 TraceCheckUtils]: 115: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,753 INFO L290 TraceCheckUtils]: 116: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,753 INFO L290 TraceCheckUtils]: 117: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,753 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17651#true} {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:23:49,754 INFO L290 TraceCheckUtils]: 119: Hoare triple {17957#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:23:49,754 INFO L272 TraceCheckUtils]: 120: Hoare triple {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 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)); {17651#true} is VALID [2022-04-28 11:23:49,754 INFO L290 TraceCheckUtils]: 121: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,754 INFO L290 TraceCheckUtils]: 122: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,755 INFO L290 TraceCheckUtils]: 123: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,755 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17651#true} {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:23:49,755 INFO L272 TraceCheckUtils]: 125: Hoare triple {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 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)); {17651#true} is VALID [2022-04-28 11:23:49,755 INFO L290 TraceCheckUtils]: 126: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:23:49,755 INFO L290 TraceCheckUtils]: 127: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:23:49,755 INFO L290 TraceCheckUtils]: 128: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:23:49,756 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17651#true} {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #74#return; {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:23:50,477 INFO L272 TraceCheckUtils]: 130: Hoare triple {18021#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 50) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (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)); {18055#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:50,477 INFO L290 TraceCheckUtils]: 131: Hoare triple {18055#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18059#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:50,478 INFO L290 TraceCheckUtils]: 132: Hoare triple {18059#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17652#false} is VALID [2022-04-28 11:23:50,478 INFO L290 TraceCheckUtils]: 133: Hoare triple {17652#false} assume !false; {17652#false} is VALID [2022-04-28 11:23:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-28 11:23:50,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:15,684 INFO L290 TraceCheckUtils]: 133: Hoare triple {17652#false} assume !false; {17652#false} is VALID [2022-04-28 11:24:15,684 INFO L290 TraceCheckUtils]: 132: Hoare triple {18059#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17652#false} is VALID [2022-04-28 11:24:15,684 INFO L290 TraceCheckUtils]: 131: Hoare triple {18055#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18059#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:15,685 INFO L272 TraceCheckUtils]: 130: Hoare triple {18075#(= (+ (* 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)); {18055#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:15,685 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17651#true} {18075#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {18075#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:24:15,685 INFO L290 TraceCheckUtils]: 128: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,685 INFO L290 TraceCheckUtils]: 127: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,686 INFO L290 TraceCheckUtils]: 126: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,686 INFO L272 TraceCheckUtils]: 125: Hoare triple {18075#(= (+ (* 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)); {17651#true} is VALID [2022-04-28 11:24:15,686 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17651#true} {18075#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {18075#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:24:15,686 INFO L290 TraceCheckUtils]: 123: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,686 INFO L290 TraceCheckUtils]: 122: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,686 INFO L290 TraceCheckUtils]: 121: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,686 INFO L272 TraceCheckUtils]: 120: Hoare triple {18075#(= (+ (* 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)); {17651#true} is VALID [2022-04-28 11:24:15,687 INFO L290 TraceCheckUtils]: 119: Hoare triple {18109#(or (= (+ (* 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); {18075#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:24:15,687 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17651#true} {18109#(or (= (+ (* 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))} #70#return; {18109#(or (= (+ (* 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-28 11:24:15,687 INFO L290 TraceCheckUtils]: 117: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,687 INFO L290 TraceCheckUtils]: 116: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,687 INFO L290 TraceCheckUtils]: 115: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,687 INFO L272 TraceCheckUtils]: 114: Hoare triple {18109#(or (= (+ (* 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)); {17651#true} is VALID [2022-04-28 11:24:15,688 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17651#true} {18109#(or (= (+ (* 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))} #68#return; {18109#(or (= (+ (* 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-28 11:24:15,688 INFO L290 TraceCheckUtils]: 112: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,688 INFO L290 TraceCheckUtils]: 111: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,688 INFO L272 TraceCheckUtils]: 109: Hoare triple {18109#(or (= (+ (* 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)); {17651#true} is VALID [2022-04-28 11:24:15,689 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17651#true} {18109#(or (= (+ (* 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))} #66#return; {18109#(or (= (+ (* 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-28 11:24:15,689 INFO L290 TraceCheckUtils]: 107: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,689 INFO L290 TraceCheckUtils]: 106: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,689 INFO L290 TraceCheckUtils]: 105: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,689 INFO L272 TraceCheckUtils]: 104: Hoare triple {18109#(or (= (+ (* 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)); {17651#true} is VALID [2022-04-28 11:24:15,689 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17651#true} {18109#(or (= (+ (* 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))} #64#return; {18109#(or (= (+ (* 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-28 11:24:15,689 INFO L290 TraceCheckUtils]: 102: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,690 INFO L290 TraceCheckUtils]: 101: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,690 INFO L290 TraceCheckUtils]: 100: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,690 INFO L272 TraceCheckUtils]: 99: Hoare triple {18109#(or (= (+ (* 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)); {17651#true} is VALID [2022-04-28 11:24:15,690 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} {18173#(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))} #62#return; {18109#(or (= (+ (* 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-28 11:24:15,691 INFO L290 TraceCheckUtils]: 97: Hoare triple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:15,691 INFO L290 TraceCheckUtils]: 96: Hoare triple {18183#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:15,691 INFO L290 TraceCheckUtils]: 95: Hoare triple {17651#true} ~cond := #in~cond; {18183#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:24:15,691 INFO L272 TraceCheckUtils]: 94: Hoare triple {18173#(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 ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,692 INFO L290 TraceCheckUtils]: 93: Hoare triple {18173#(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 !false; {18173#(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-28 11:24:15,696 INFO L290 TraceCheckUtils]: 92: Hoare triple {18193#(or (= (+ (* (div main_~z~0 6) 12) (* main_~a~0 (+ 6 (* 6 (div main_~z~0 6)))) 12) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)) (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (< (+ main_~a~0 1) (div 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; {18173#(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-28 11:24:15,700 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} {17651#true} #70#return; {18193#(or (= (+ (* (div main_~z~0 6) 12) (* main_~a~0 (+ 6 (* 6 (div main_~z~0 6)))) 12) (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10)) (<= (div main_~z~0 6) main_~a~0) (not (= (mod main_~z~0 6) 0)) (< (+ main_~a~0 1) (div main_~z~0 6)))} is VALID [2022-04-28 11:24:15,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:15,701 INFO L290 TraceCheckUtils]: 89: Hoare triple {18183#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:15,701 INFO L290 TraceCheckUtils]: 88: Hoare triple {17651#true} ~cond := #in~cond; {18183#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:24:15,701 INFO L272 TraceCheckUtils]: 87: Hoare triple {17651#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,701 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17651#true} {17651#true} #68#return; {17651#true} is VALID [2022-04-28 11:24:15,701 INFO L290 TraceCheckUtils]: 85: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,701 INFO L290 TraceCheckUtils]: 83: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,701 INFO L272 TraceCheckUtils]: 82: Hoare triple {17651#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,701 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17651#true} {17651#true} #66#return; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 80: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 79: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 78: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L272 TraceCheckUtils]: 77: Hoare triple {17651#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17651#true} {17651#true} #64#return; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 75: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 73: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L272 TraceCheckUtils]: 72: Hoare triple {17651#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17651#true} {17651#true} #62#return; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 69: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L272 TraceCheckUtils]: 67: Hoare triple {17651#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {17651#true} assume !false; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {17651#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; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17651#true} {17651#true} #70#return; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L272 TraceCheckUtils]: 60: Hoare triple {17651#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17651#true} {17651#true} #68#return; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L272 TraceCheckUtils]: 55: Hoare triple {17651#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17651#true} {17651#true} #66#return; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L272 TraceCheckUtils]: 50: Hoare triple {17651#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17651#true} {17651#true} #64#return; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L272 TraceCheckUtils]: 45: Hoare triple {17651#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17651#true} {17651#true} #62#return; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L272 TraceCheckUtils]: 40: Hoare triple {17651#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {17651#true} assume !false; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {17651#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; {17651#true} is VALID [2022-04-28 11:24:15,704 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17651#true} {17651#true} #70#return; {17651#true} is VALID [2022-04-28 11:24:15,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,705 INFO L272 TraceCheckUtils]: 33: Hoare triple {17651#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,705 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17651#true} {17651#true} #68#return; {17651#true} is VALID [2022-04-28 11:24:15,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L272 TraceCheckUtils]: 28: Hoare triple {17651#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17651#true} {17651#true} #66#return; {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L272 TraceCheckUtils]: 23: Hoare triple {17651#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17651#true} {17651#true} #64#return; {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L272 TraceCheckUtils]: 18: Hoare triple {17651#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17651#true} {17651#true} #62#return; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L272 TraceCheckUtils]: 13: Hoare triple {17651#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {17651#true} assume !false; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {17651#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17651#true} {17651#true} #60#return; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {17651#true} assume !(0 == ~cond); {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {17651#true} ~cond := #in~cond; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {17651#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {17651#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; {17651#true} is VALID [2022-04-28 11:24:15,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {17651#true} call #t~ret5 := main(); {17651#true} is VALID [2022-04-28 11:24:15,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17651#true} {17651#true} #84#return; {17651#true} is VALID [2022-04-28 11:24:15,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {17651#true} assume true; {17651#true} is VALID [2022-04-28 11:24:15,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {17651#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); {17651#true} is VALID [2022-04-28 11:24:15,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {17651#true} call ULTIMATE.init(); {17651#true} is VALID [2022-04-28 11:24:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-04-28 11:24:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:15,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312082100] [2022-04-28 11:24:15,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:15,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275838496] [2022-04-28 11:24:15,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275838496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:15,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:15,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-28 11:24:15,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:15,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436398347] [2022-04-28 11:24:15,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436398347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:15,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:15,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:24:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935946677] [2022-04-28 11:24:15,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:15,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 134 [2022-04-28 11:24:15,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:15,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:24:15,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:15,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:24:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:15,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:24:15,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:24:15,984 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:24:20,260 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-28 11:24:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:28,887 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2022-04-28 11:24:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:24:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 134 [2022-04-28 11:24:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:24:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:24:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:24:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:24:28,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-28 11:24:29,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:29,437 INFO L225 Difference]: With dead ends: 144 [2022-04-28 11:24:29,437 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 11:24:29,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:24:29,438 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:29,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 174 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2022-04-28 11:24:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 11:24:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2022-04-28 11:24:29,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:29,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:24:29,562 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:24:29,562 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:24:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:29,564 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-04-28 11:24:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2022-04-28 11:24:29,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:29,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:29,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 142 states. [2022-04-28 11:24:29,564 INFO L87 Difference]: Start difference. First operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 142 states. [2022-04-28 11:24:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:29,566 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-04-28 11:24:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2022-04-28 11:24:29,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:29,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:29,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:29,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:24:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2022-04-28 11:24:29,569 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 134 [2022-04-28 11:24:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:29,569 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2022-04-28 11:24:29,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-28 11:24:29,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 147 transitions. [2022-04-28 11:24:34,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 145 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2022-04-28 11:24:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 11:24:34,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:34,881 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:34,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 11:24:35,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:35,087 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 19 times [2022-04-28 11:24:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:35,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620575922] [2022-04-28 11:24:35,299 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:35,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 20 times [2022-04-28 11:24:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:35,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23557286] [2022-04-28 11:24:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:35,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:35,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376709940] [2022-04-28 11:24:35,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:35,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:35,307 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:35,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 11:24:35,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:35,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:35,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:24:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:35,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:35,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {19332#true} call ULTIMATE.init(); {19332#true} is VALID [2022-04-28 11:24:35,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {19332#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); {19332#true} is VALID [2022-04-28 11:24:35,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19332#true} {19332#true} #84#return; {19332#true} is VALID [2022-04-28 11:24:35,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {19332#true} call #t~ret5 := main(); {19332#true} is VALID [2022-04-28 11:24:35,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {19332#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; {19332#true} is VALID [2022-04-28 11:24:35,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {19332#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19332#true} {19332#true} #60#return; {19332#true} is VALID [2022-04-28 11:24:35,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {19332#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:35,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:35,984 INFO L272 TraceCheckUtils]: 13: Hoare triple {19370#(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)); {19332#true} is VALID [2022-04-28 11:24:35,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,985 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19332#true} {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:35,985 INFO L272 TraceCheckUtils]: 18: Hoare triple {19370#(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)); {19332#true} is VALID [2022-04-28 11:24:35,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,986 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19332#true} {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:35,986 INFO L272 TraceCheckUtils]: 23: Hoare triple {19370#(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)); {19332#true} is VALID [2022-04-28 11:24:35,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,987 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19332#true} {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:35,987 INFO L272 TraceCheckUtils]: 28: Hoare triple {19370#(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)); {19332#true} is VALID [2022-04-28 11:24:35,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,987 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19332#true} {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:35,988 INFO L272 TraceCheckUtils]: 33: Hoare triple {19370#(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)); {19332#true} is VALID [2022-04-28 11:24:35,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,988 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19332#true} {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {19370#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:35,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {19370#(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; {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:24:35,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} assume !false; {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:24:35,989 INFO L272 TraceCheckUtils]: 40: Hoare triple {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,990 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19332#true} {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #62#return; {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:24:35,990 INFO L272 TraceCheckUtils]: 45: Hoare triple {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~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)); {19332#true} is VALID [2022-04-28 11:24:35,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,990 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19332#true} {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #64#return; {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:24:35,991 INFO L272 TraceCheckUtils]: 50: Hoare triple {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,991 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19332#true} {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #66#return; {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:24:35,991 INFO L272 TraceCheckUtils]: 55: Hoare triple {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,992 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19332#true} {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #68#return; {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:24:35,992 INFO L272 TraceCheckUtils]: 60: Hoare triple {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,993 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19332#true} {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} #70#return; {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-28 11:24:35,993 INFO L290 TraceCheckUtils]: 65: Hoare triple {19452#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~x~0 6 (* (- 1) main_~y~0)) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:24:35,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} assume !false; {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:24:35,994 INFO L272 TraceCheckUtils]: 67: Hoare triple {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,994 INFO L290 TraceCheckUtils]: 69: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,994 INFO L290 TraceCheckUtils]: 70: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,994 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19332#true} {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #62#return; {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:24:35,994 INFO L272 TraceCheckUtils]: 72: Hoare triple {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,994 INFO L290 TraceCheckUtils]: 73: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,994 INFO L290 TraceCheckUtils]: 74: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,994 INFO L290 TraceCheckUtils]: 75: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,995 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19332#true} {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #64#return; {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:24:35,995 INFO L272 TraceCheckUtils]: 77: Hoare triple {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,995 INFO L290 TraceCheckUtils]: 78: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,995 INFO L290 TraceCheckUtils]: 79: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,995 INFO L290 TraceCheckUtils]: 80: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,996 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19332#true} {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #66#return; {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:24:35,996 INFO L272 TraceCheckUtils]: 82: Hoare triple {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,996 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19332#true} {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #68#return; {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:24:35,996 INFO L272 TraceCheckUtils]: 87: Hoare triple {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,996 INFO L290 TraceCheckUtils]: 88: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,997 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19332#true} {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} #70#return; {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:24:35,997 INFO L290 TraceCheckUtils]: 92: Hoare triple {19534#(and (= (+ main_~x~0 (- 6) (* main_~z~0 2) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 6)) 12) (= (+ main_~y~0 (* (- 1) main_~z~0)) 1) (= (+ (- 2) 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; {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:24:35,998 INFO L290 TraceCheckUtils]: 93: Hoare triple {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} assume !false; {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:24:35,998 INFO L272 TraceCheckUtils]: 94: Hoare triple {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,998 INFO L290 TraceCheckUtils]: 95: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,998 INFO L290 TraceCheckUtils]: 96: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,998 INFO L290 TraceCheckUtils]: 97: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,999 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19332#true} {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #62#return; {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:24:35,999 INFO L272 TraceCheckUtils]: 99: Hoare triple {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,999 INFO L290 TraceCheckUtils]: 100: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,999 INFO L290 TraceCheckUtils]: 101: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:35,999 INFO L290 TraceCheckUtils]: 102: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:35,999 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19332#true} {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #64#return; {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:24:35,999 INFO L272 TraceCheckUtils]: 104: Hoare triple {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:35,999 INFO L290 TraceCheckUtils]: 105: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:35,999 INFO L290 TraceCheckUtils]: 106: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,000 INFO L290 TraceCheckUtils]: 107: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,000 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19332#true} {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #66#return; {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:24:36,000 INFO L272 TraceCheckUtils]: 109: Hoare triple {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,000 INFO L290 TraceCheckUtils]: 110: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,000 INFO L290 TraceCheckUtils]: 111: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,000 INFO L290 TraceCheckUtils]: 112: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,001 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19332#true} {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #68#return; {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:24:36,001 INFO L272 TraceCheckUtils]: 114: Hoare triple {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,001 INFO L290 TraceCheckUtils]: 115: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,001 INFO L290 TraceCheckUtils]: 116: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,001 INFO L290 TraceCheckUtils]: 117: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,001 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19332#true} {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} #70#return; {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:24:36,002 INFO L290 TraceCheckUtils]: 119: Hoare triple {19616#(and (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0) (= (+ main_~n~0 (- 3)) 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; {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:36,002 INFO L290 TraceCheckUtils]: 120: Hoare triple {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} assume !false; {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:36,002 INFO L272 TraceCheckUtils]: 121: Hoare triple {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,002 INFO L290 TraceCheckUtils]: 122: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,002 INFO L290 TraceCheckUtils]: 123: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,002 INFO L290 TraceCheckUtils]: 124: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,003 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19332#true} {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} #62#return; {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:36,003 INFO L272 TraceCheckUtils]: 126: Hoare triple {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,003 INFO L290 TraceCheckUtils]: 127: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,003 INFO L290 TraceCheckUtils]: 128: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,003 INFO L290 TraceCheckUtils]: 129: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,003 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19332#true} {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} #64#return; {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:36,004 INFO L272 TraceCheckUtils]: 131: Hoare triple {19698#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:36,004 INFO L290 TraceCheckUtils]: 132: Hoare triple {19735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:36,004 INFO L290 TraceCheckUtils]: 133: Hoare triple {19739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19333#false} is VALID [2022-04-28 11:24:36,005 INFO L290 TraceCheckUtils]: 134: Hoare triple {19333#false} assume !false; {19333#false} is VALID [2022-04-28 11:24:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:24:36,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:36,436 INFO L290 TraceCheckUtils]: 134: Hoare triple {19333#false} assume !false; {19333#false} is VALID [2022-04-28 11:24:36,437 INFO L290 TraceCheckUtils]: 133: Hoare triple {19739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19333#false} is VALID [2022-04-28 11:24:36,437 INFO L290 TraceCheckUtils]: 132: Hoare triple {19735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:36,437 INFO L272 TraceCheckUtils]: 131: Hoare triple {19755#(= (* 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)); {19735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:36,438 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19332#true} {19755#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {19755#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:36,438 INFO L290 TraceCheckUtils]: 129: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,438 INFO L290 TraceCheckUtils]: 128: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,438 INFO L290 TraceCheckUtils]: 127: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,438 INFO L272 TraceCheckUtils]: 126: Hoare triple {19755#(= (* 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)); {19332#true} is VALID [2022-04-28 11:24:36,438 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19332#true} {19755#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {19755#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:36,439 INFO L290 TraceCheckUtils]: 124: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,439 INFO L290 TraceCheckUtils]: 123: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,439 INFO L290 TraceCheckUtils]: 122: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,439 INFO L272 TraceCheckUtils]: 121: Hoare triple {19755#(= (* 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)); {19332#true} is VALID [2022-04-28 11:24:36,439 INFO L290 TraceCheckUtils]: 120: Hoare triple {19755#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {19755#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:36,441 INFO L290 TraceCheckUtils]: 119: Hoare triple {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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; {19755#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:36,442 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19332#true} {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #70#return; {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:36,442 INFO L290 TraceCheckUtils]: 117: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,442 INFO L290 TraceCheckUtils]: 116: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,442 INFO L290 TraceCheckUtils]: 115: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,442 INFO L272 TraceCheckUtils]: 114: Hoare triple {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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)); {19332#true} is VALID [2022-04-28 11:24:36,442 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19332#true} {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #68#return; {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:36,443 INFO L290 TraceCheckUtils]: 112: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,443 INFO L290 TraceCheckUtils]: 111: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,443 INFO L290 TraceCheckUtils]: 110: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,443 INFO L272 TraceCheckUtils]: 109: Hoare triple {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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)); {19332#true} is VALID [2022-04-28 11:24:36,443 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19332#true} {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #66#return; {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:36,443 INFO L290 TraceCheckUtils]: 107: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,443 INFO L290 TraceCheckUtils]: 106: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,443 INFO L290 TraceCheckUtils]: 105: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,443 INFO L272 TraceCheckUtils]: 104: Hoare triple {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,444 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19332#true} {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #64#return; {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:36,444 INFO L290 TraceCheckUtils]: 102: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,444 INFO L290 TraceCheckUtils]: 101: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,444 INFO L290 TraceCheckUtils]: 100: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,444 INFO L272 TraceCheckUtils]: 99: Hoare triple {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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)); {19332#true} is VALID [2022-04-28 11:24:36,445 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19332#true} {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #62#return; {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:36,445 INFO L290 TraceCheckUtils]: 97: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,445 INFO L290 TraceCheckUtils]: 96: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,445 INFO L290 TraceCheckUtils]: 95: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,445 INFO L272 TraceCheckUtils]: 94: Hoare triple {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,445 INFO L290 TraceCheckUtils]: 93: Hoare triple {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} assume !false; {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:36,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~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; {19792#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:36,447 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19332#true} {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #70#return; {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:24:36,448 INFO L290 TraceCheckUtils]: 90: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,448 INFO L290 TraceCheckUtils]: 89: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,448 INFO L290 TraceCheckUtils]: 88: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,448 INFO L272 TraceCheckUtils]: 87: Hoare triple {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,448 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19332#true} {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #68#return; {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:24:36,448 INFO L290 TraceCheckUtils]: 85: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,448 INFO L290 TraceCheckUtils]: 84: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,448 INFO L290 TraceCheckUtils]: 83: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,448 INFO L272 TraceCheckUtils]: 82: Hoare triple {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~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)); {19332#true} is VALID [2022-04-28 11:24:36,449 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19332#true} {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #66#return; {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:24:36,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,449 INFO L290 TraceCheckUtils]: 79: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,449 INFO L290 TraceCheckUtils]: 78: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,449 INFO L272 TraceCheckUtils]: 77: Hoare triple {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,449 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19332#true} {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #64#return; {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:24:36,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,450 INFO L290 TraceCheckUtils]: 73: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,450 INFO L272 TraceCheckUtils]: 72: Hoare triple {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,450 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19332#true} {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #62#return; {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:24:36,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,450 INFO L290 TraceCheckUtils]: 68: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,450 INFO L272 TraceCheckUtils]: 67: Hoare triple {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} assume !false; {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:24:36,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 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; {19874#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:24:36,453 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19332#true} {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #70#return; {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:24:36,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,454 INFO L272 TraceCheckUtils]: 60: Hoare triple {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,454 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19332#true} {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #68#return; {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:24:36,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,454 INFO L272 TraceCheckUtils]: 55: Hoare triple {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,455 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19332#true} {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #66#return; {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:24:36,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,455 INFO L272 TraceCheckUtils]: 50: Hoare triple {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,456 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19332#true} {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #64#return; {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:24:36,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,456 INFO L272 TraceCheckUtils]: 45: Hoare triple {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,456 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19332#true} {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #62#return; {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:24:36,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,457 INFO L272 TraceCheckUtils]: 40: Hoare triple {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} assume !false; {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:24:36,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 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; {19956#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:24:36,459 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19332#true} {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #70#return; {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:24:36,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,460 INFO L272 TraceCheckUtils]: 33: Hoare triple {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,460 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19332#true} {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #68#return; {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:24:36,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,460 INFO L272 TraceCheckUtils]: 28: Hoare triple {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,461 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19332#true} {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #66#return; {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:24:36,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,461 INFO L272 TraceCheckUtils]: 23: Hoare triple {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,461 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19332#true} {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #64#return; {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:24:36,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,462 INFO L272 TraceCheckUtils]: 18: Hoare triple {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,462 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19332#true} {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #62#return; {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:24:36,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,463 INFO L272 TraceCheckUtils]: 13: Hoare triple {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} assume !false; {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:24:36,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {19332#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {20038#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:24:36,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19332#true} {19332#true} #60#return; {19332#true} is VALID [2022-04-28 11:24:36,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {19332#true} assume !(0 == ~cond); {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {19332#true} ~cond := #in~cond; {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {19332#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {19332#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; {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {19332#true} call #t~ret5 := main(); {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19332#true} {19332#true} #84#return; {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {19332#true} assume true; {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {19332#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); {19332#true} is VALID [2022-04-28 11:24:36,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {19332#true} call ULTIMATE.init(); {19332#true} is VALID [2022-04-28 11:24:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:24:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:36,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23557286] [2022-04-28 11:24:36,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:36,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376709940] [2022-04-28 11:24:36,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376709940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:36,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:36,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 11:24:36,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:36,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620575922] [2022-04-28 11:24:36,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620575922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:36,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:36,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:24:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641387715] [2022-04-28 11:24:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:24:36,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:36,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:24:36,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:36,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:24:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:24:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:24:36,528 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:24:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:38,927 INFO L93 Difference]: Finished difference Result 180 states and 202 transitions. [2022-04-28 11:24:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:24:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:24:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:24:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-04-28 11:24:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:24:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-04-28 11:24:38,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 130 transitions. [2022-04-28 11:24:39,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:39,055 INFO L225 Difference]: With dead ends: 180 [2022-04-28 11:24:39,055 INFO L226 Difference]: Without dead ends: 172 [2022-04-28 11:24:39,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:24:39,057 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:39,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 301 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 11:24:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-28 11:24:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2022-04-28 11:24:39,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:39,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:24:39,212 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:24:39,212 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:24:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:39,214 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2022-04-28 11:24:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-04-28 11:24:39,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:39,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:39,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 172 states. [2022-04-28 11:24:39,215 INFO L87 Difference]: Start difference. First operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 172 states. [2022-04-28 11:24:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:39,219 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2022-04-28 11:24:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-04-28 11:24:39,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:39,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:39,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:39,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:24:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2022-04-28 11:24:39,222 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 135 [2022-04-28 11:24:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:39,222 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2022-04-28 11:24:39,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:24:39,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 171 transitions. [2022-04-28 11:24:46,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 168 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2022-04-28 11:24:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 11:24:46,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:46,322 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:46,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:46,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:46,535 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 21 times [2022-04-28 11:24:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:46,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234190944] [2022-04-28 11:24:46,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:46,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 22 times [2022-04-28 11:24:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:46,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048285167] [2022-04-28 11:24:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:46,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:46,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857896401] [2022-04-28 11:24:46,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:24:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:46,806 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:46,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:24:46,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:24:46,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:46,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 11:24:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:46,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:47,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {21187#true} call ULTIMATE.init(); {21187#true} is VALID [2022-04-28 11:24:47,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {21187#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); {21187#true} is VALID [2022-04-28 11:24:47,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21187#true} {21187#true} #84#return; {21187#true} is VALID [2022-04-28 11:24:47,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {21187#true} call #t~ret5 := main(); {21187#true} is VALID [2022-04-28 11:24:47,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {21187#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; {21187#true} is VALID [2022-04-28 11:24:47,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {21187#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21187#true} {21187#true} #60#return; {21187#true} is VALID [2022-04-28 11:24:47,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {21187#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:47,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:47,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {21225#(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)); {21187#true} is VALID [2022-04-28 11:24:47,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,550 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21187#true} {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:47,550 INFO L272 TraceCheckUtils]: 18: Hoare triple {21225#(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)); {21187#true} is VALID [2022-04-28 11:24:47,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,551 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21187#true} {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:47,551 INFO L272 TraceCheckUtils]: 23: Hoare triple {21225#(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)); {21187#true} is VALID [2022-04-28 11:24:47,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,552 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21187#true} {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:47,552 INFO L272 TraceCheckUtils]: 28: Hoare triple {21225#(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)); {21187#true} is VALID [2022-04-28 11:24:47,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,552 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21187#true} {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:47,553 INFO L272 TraceCheckUtils]: 33: Hoare triple {21225#(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)); {21187#true} is VALID [2022-04-28 11:24:47,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,553 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21187#true} {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {21225#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:47,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {21225#(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; {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:24:47,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:24:47,554 INFO L272 TraceCheckUtils]: 40: Hoare triple {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,555 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21187#true} {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:24:47,555 INFO L272 TraceCheckUtils]: 45: Hoare triple {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,556 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21187#true} {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:24:47,556 INFO L272 TraceCheckUtils]: 50: Hoare triple {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,556 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21187#true} {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:24:47,556 INFO L272 TraceCheckUtils]: 55: Hoare triple {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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)); {21187#true} is VALID [2022-04-28 11:24:47,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,557 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21187#true} {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:24:47,557 INFO L272 TraceCheckUtils]: 60: Hoare triple {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,558 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21187#true} {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:24:47,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {21307#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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; {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:24:47,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} assume !false; {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:24:47,559 INFO L272 TraceCheckUtils]: 67: Hoare triple {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,560 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21187#true} {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #62#return; {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:24:47,560 INFO L272 TraceCheckUtils]: 72: Hoare triple {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,560 INFO L290 TraceCheckUtils]: 73: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,560 INFO L290 TraceCheckUtils]: 74: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,560 INFO L290 TraceCheckUtils]: 75: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,560 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21187#true} {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #64#return; {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:24:47,560 INFO L272 TraceCheckUtils]: 77: Hoare triple {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,560 INFO L290 TraceCheckUtils]: 78: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,560 INFO L290 TraceCheckUtils]: 79: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,561 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21187#true} {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #66#return; {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:24:47,561 INFO L272 TraceCheckUtils]: 82: Hoare triple {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~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)); {21187#true} is VALID [2022-04-28 11:24:47,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,562 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21187#true} {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #68#return; {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:24:47,562 INFO L272 TraceCheckUtils]: 87: Hoare triple {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,562 INFO L290 TraceCheckUtils]: 88: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,562 INFO L290 TraceCheckUtils]: 90: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,563 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21187#true} {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #70#return; {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:24:47,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {21389#(and (= main_~z~0 18) (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~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; {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:24:47,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} assume !false; {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:24:47,564 INFO L272 TraceCheckUtils]: 94: Hoare triple {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,564 INFO L290 TraceCheckUtils]: 95: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,564 INFO L290 TraceCheckUtils]: 97: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,564 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21187#true} {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #62#return; {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:24:47,565 INFO L272 TraceCheckUtils]: 99: Hoare triple {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,565 INFO L290 TraceCheckUtils]: 100: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,565 INFO L290 TraceCheckUtils]: 101: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,565 INFO L290 TraceCheckUtils]: 102: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,565 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21187#true} {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #64#return; {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:24:47,565 INFO L272 TraceCheckUtils]: 104: Hoare triple {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,565 INFO L290 TraceCheckUtils]: 105: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,565 INFO L290 TraceCheckUtils]: 106: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,566 INFO L290 TraceCheckUtils]: 107: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,566 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21187#true} {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #66#return; {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:24:47,566 INFO L272 TraceCheckUtils]: 109: Hoare triple {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,566 INFO L290 TraceCheckUtils]: 110: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,566 INFO L290 TraceCheckUtils]: 111: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,566 INFO L290 TraceCheckUtils]: 112: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,567 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21187#true} {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #68#return; {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:24:47,567 INFO L272 TraceCheckUtils]: 114: Hoare triple {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,567 INFO L290 TraceCheckUtils]: 115: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,567 INFO L290 TraceCheckUtils]: 116: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,567 INFO L290 TraceCheckUtils]: 117: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,568 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21187#true} {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} #70#return; {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 18))} is VALID [2022-04-28 11:24:47,568 INFO L290 TraceCheckUtils]: 119: Hoare triple {21471#(and (= main_~x~0 (+ main_~y~0 (* (- 1) main_~z~0) 14)) (= 2 (+ (- 1) main_~n~0)) (= 19 (+ main_~y~0 (* (- 1) main_~z~0) 6)) (= (+ main_~z~0 (- 6)) 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; {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:47,569 INFO L290 TraceCheckUtils]: 120: Hoare triple {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} assume !false; {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:47,569 INFO L272 TraceCheckUtils]: 121: Hoare triple {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,569 INFO L290 TraceCheckUtils]: 122: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,569 INFO L290 TraceCheckUtils]: 123: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,569 INFO L290 TraceCheckUtils]: 124: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,569 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21187#true} {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #62#return; {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:47,570 INFO L272 TraceCheckUtils]: 126: Hoare triple {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,570 INFO L290 TraceCheckUtils]: 127: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,570 INFO L290 TraceCheckUtils]: 128: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,570 INFO L290 TraceCheckUtils]: 129: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,570 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21187#true} {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #64#return; {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:47,570 INFO L272 TraceCheckUtils]: 131: Hoare triple {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,570 INFO L290 TraceCheckUtils]: 132: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,571 INFO L290 TraceCheckUtils]: 133: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,571 INFO L290 TraceCheckUtils]: 134: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,571 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21187#true} {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #66#return; {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:47,571 INFO L272 TraceCheckUtils]: 136: Hoare triple {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 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)); {21187#true} is VALID [2022-04-28 11:24:47,571 INFO L290 TraceCheckUtils]: 137: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,571 INFO L290 TraceCheckUtils]: 138: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,571 INFO L290 TraceCheckUtils]: 139: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,572 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21187#true} {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #68#return; {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:47,572 INFO L272 TraceCheckUtils]: 141: Hoare triple {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,572 INFO L290 TraceCheckUtils]: 142: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,572 INFO L290 TraceCheckUtils]: 143: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,572 INFO L290 TraceCheckUtils]: 144: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,573 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21187#true} {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} #70#return; {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 main_~x~0))} is VALID [2022-04-28 11:24:47,573 INFO L290 TraceCheckUtils]: 146: Hoare triple {21553#(and (= main_~n~0 4) (= main_~y~0 61) (= 64 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; {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:24:47,573 INFO L290 TraceCheckUtils]: 147: Hoare triple {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} assume !false; {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:24:47,573 INFO L272 TraceCheckUtils]: 148: Hoare triple {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,574 INFO L290 TraceCheckUtils]: 149: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,574 INFO L290 TraceCheckUtils]: 150: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,574 INFO L290 TraceCheckUtils]: 151: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,574 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21187#true} {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} #62#return; {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:24:47,574 INFO L272 TraceCheckUtils]: 153: Hoare triple {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:47,574 INFO L290 TraceCheckUtils]: 154: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:47,574 INFO L290 TraceCheckUtils]: 155: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:47,574 INFO L290 TraceCheckUtils]: 156: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:47,575 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21187#true} {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} #64#return; {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} is VALID [2022-04-28 11:24:47,575 INFO L272 TraceCheckUtils]: 158: Hoare triple {21635#(and (= 61 (+ (- 64) main_~x~0)) (= 5 main_~n~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:47,576 INFO L290 TraceCheckUtils]: 159: Hoare triple {21672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:47,576 INFO L290 TraceCheckUtils]: 160: Hoare triple {21676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21188#false} is VALID [2022-04-28 11:24:47,576 INFO L290 TraceCheckUtils]: 161: Hoare triple {21188#false} assume !false; {21188#false} is VALID [2022-04-28 11:24:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:24:47,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:48,223 INFO L290 TraceCheckUtils]: 161: Hoare triple {21188#false} assume !false; {21188#false} is VALID [2022-04-28 11:24:48,224 INFO L290 TraceCheckUtils]: 160: Hoare triple {21676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21188#false} is VALID [2022-04-28 11:24:48,224 INFO L290 TraceCheckUtils]: 159: Hoare triple {21672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:48,224 INFO L272 TraceCheckUtils]: 158: Hoare triple {21692#(= (* 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)); {21672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:48,225 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21187#true} {21692#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {21692#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:48,225 INFO L290 TraceCheckUtils]: 156: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,225 INFO L290 TraceCheckUtils]: 155: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,225 INFO L290 TraceCheckUtils]: 154: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,225 INFO L272 TraceCheckUtils]: 153: Hoare triple {21692#(= (* 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)); {21187#true} is VALID [2022-04-28 11:24:48,226 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21187#true} {21692#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {21692#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:48,226 INFO L290 TraceCheckUtils]: 151: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,226 INFO L290 TraceCheckUtils]: 150: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,226 INFO L290 TraceCheckUtils]: 149: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,226 INFO L272 TraceCheckUtils]: 148: Hoare triple {21692#(= (* 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)); {21187#true} is VALID [2022-04-28 11:24:48,226 INFO L290 TraceCheckUtils]: 147: Hoare triple {21692#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {21692#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:48,228 INFO L290 TraceCheckUtils]: 146: Hoare triple {21729#(= (* (+ 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; {21692#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:24:48,229 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21187#true} {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:48,229 INFO L290 TraceCheckUtils]: 144: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,229 INFO L290 TraceCheckUtils]: 143: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,229 INFO L290 TraceCheckUtils]: 142: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,229 INFO L272 TraceCheckUtils]: 141: Hoare triple {21729#(= (* (+ 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)); {21187#true} is VALID [2022-04-28 11:24:48,229 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21187#true} {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:48,230 INFO L290 TraceCheckUtils]: 139: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,230 INFO L290 TraceCheckUtils]: 138: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,230 INFO L290 TraceCheckUtils]: 137: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,230 INFO L272 TraceCheckUtils]: 136: Hoare triple {21729#(= (* (+ 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)); {21187#true} is VALID [2022-04-28 11:24:48,230 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21187#true} {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:48,230 INFO L290 TraceCheckUtils]: 134: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,230 INFO L290 TraceCheckUtils]: 133: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,230 INFO L290 TraceCheckUtils]: 132: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,230 INFO L272 TraceCheckUtils]: 131: Hoare triple {21729#(= (* (+ 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)); {21187#true} is VALID [2022-04-28 11:24:48,231 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21187#true} {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:48,231 INFO L290 TraceCheckUtils]: 129: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,231 INFO L290 TraceCheckUtils]: 128: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,231 INFO L290 TraceCheckUtils]: 127: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,231 INFO L272 TraceCheckUtils]: 126: Hoare triple {21729#(= (* (+ 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)); {21187#true} is VALID [2022-04-28 11:24:48,232 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21187#true} {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:48,232 INFO L290 TraceCheckUtils]: 124: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,232 INFO L290 TraceCheckUtils]: 123: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,232 INFO L290 TraceCheckUtils]: 122: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,232 INFO L272 TraceCheckUtils]: 121: Hoare triple {21729#(= (* (+ 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)); {21187#true} is VALID [2022-04-28 11:24:48,232 INFO L290 TraceCheckUtils]: 120: Hoare triple {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:48,235 INFO L290 TraceCheckUtils]: 119: Hoare triple {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {21729#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:24:48,235 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21187#true} {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:24:48,235 INFO L290 TraceCheckUtils]: 117: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,236 INFO L290 TraceCheckUtils]: 116: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,236 INFO L290 TraceCheckUtils]: 115: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,236 INFO L272 TraceCheckUtils]: 114: Hoare triple {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,236 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21187#true} {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:24:48,236 INFO L290 TraceCheckUtils]: 112: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,236 INFO L290 TraceCheckUtils]: 111: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,236 INFO L290 TraceCheckUtils]: 110: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,236 INFO L272 TraceCheckUtils]: 109: Hoare triple {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {21187#true} is VALID [2022-04-28 11:24:48,237 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21187#true} {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:24:48,237 INFO L290 TraceCheckUtils]: 107: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,237 INFO L290 TraceCheckUtils]: 106: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,237 INFO L290 TraceCheckUtils]: 105: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,237 INFO L272 TraceCheckUtils]: 104: Hoare triple {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,238 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21187#true} {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:24:48,238 INFO L290 TraceCheckUtils]: 102: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,238 INFO L290 TraceCheckUtils]: 101: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,238 INFO L290 TraceCheckUtils]: 100: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,238 INFO L272 TraceCheckUtils]: 99: Hoare triple {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,238 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21187#true} {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:24:48,238 INFO L290 TraceCheckUtils]: 97: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,238 INFO L290 TraceCheckUtils]: 96: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,238 INFO L290 TraceCheckUtils]: 95: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,239 INFO L272 TraceCheckUtils]: 94: Hoare triple {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,239 INFO L290 TraceCheckUtils]: 93: Hoare triple {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:24:48,241 INFO L290 TraceCheckUtils]: 92: Hoare triple {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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; {21811#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:24:48,242 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21187#true} {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #70#return; {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:24:48,242 INFO L290 TraceCheckUtils]: 90: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,242 INFO L290 TraceCheckUtils]: 89: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,242 INFO L290 TraceCheckUtils]: 88: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,242 INFO L272 TraceCheckUtils]: 87: Hoare triple {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,243 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21187#true} {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #68#return; {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:24:48,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,243 INFO L272 TraceCheckUtils]: 82: Hoare triple {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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)); {21187#true} is VALID [2022-04-28 11:24:48,243 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21187#true} {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #66#return; {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:24:48,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,243 INFO L290 TraceCheckUtils]: 79: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,244 INFO L272 TraceCheckUtils]: 77: Hoare triple {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,244 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21187#true} {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #64#return; {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:24:48,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,244 INFO L272 TraceCheckUtils]: 72: Hoare triple {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,245 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21187#true} {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #62#return; {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:24:48,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,245 INFO L272 TraceCheckUtils]: 67: Hoare triple {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,245 INFO L290 TraceCheckUtils]: 66: Hoare triple {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !false; {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:24:48,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~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; {21893#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:24:48,248 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21187#true} {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #70#return; {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:24:48,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,248 INFO L272 TraceCheckUtils]: 60: Hoare triple {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,249 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21187#true} {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #68#return; {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:24:48,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,249 INFO L272 TraceCheckUtils]: 55: Hoare triple {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~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)); {21187#true} is VALID [2022-04-28 11:24:48,250 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21187#true} {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #66#return; {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:24:48,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,250 INFO L272 TraceCheckUtils]: 50: Hoare triple {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,250 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21187#true} {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #64#return; {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:24:48,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,251 INFO L272 TraceCheckUtils]: 45: Hoare triple {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,251 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21187#true} {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #62#return; {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:24:48,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,251 INFO L272 TraceCheckUtils]: 40: Hoare triple {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} assume !false; {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:24:48,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 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; {21975#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:24:48,254 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21187#true} {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #70#return; {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:24:48,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,255 INFO L272 TraceCheckUtils]: 33: Hoare triple {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,255 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21187#true} {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #68#return; {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:24:48,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,255 INFO L272 TraceCheckUtils]: 28: Hoare triple {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 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)); {21187#true} is VALID [2022-04-28 11:24:48,256 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21187#true} {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #66#return; {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:24:48,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,256 INFO L272 TraceCheckUtils]: 23: Hoare triple {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,256 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21187#true} {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #64#return; {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:24:48,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,257 INFO L272 TraceCheckUtils]: 18: Hoare triple {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,257 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21187#true} {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #62#return; {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:24:48,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,257 INFO L272 TraceCheckUtils]: 13: Hoare triple {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} assume !false; {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:24:48,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {21187#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {22057#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:24:48,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21187#true} {21187#true} #60#return; {21187#true} is VALID [2022-04-28 11:24:48,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {21187#true} assume !(0 == ~cond); {21187#true} is VALID [2022-04-28 11:24:48,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {21187#true} ~cond := #in~cond; {21187#true} is VALID [2022-04-28 11:24:48,259 INFO L272 TraceCheckUtils]: 6: Hoare triple {21187#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {21187#true} is VALID [2022-04-28 11:24:48,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {21187#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; {21187#true} is VALID [2022-04-28 11:24:48,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {21187#true} call #t~ret5 := main(); {21187#true} is VALID [2022-04-28 11:24:48,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21187#true} {21187#true} #84#return; {21187#true} is VALID [2022-04-28 11:24:48,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {21187#true} assume true; {21187#true} is VALID [2022-04-28 11:24:48,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {21187#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); {21187#true} is VALID [2022-04-28 11:24:48,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {21187#true} call ULTIMATE.init(); {21187#true} is VALID [2022-04-28 11:24:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:24:48,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:48,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048285167] [2022-04-28 11:24:48,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:48,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857896401] [2022-04-28 11:24:48,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857896401] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:48,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:48,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 11:24:48,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:48,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234190944] [2022-04-28 11:24:48,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234190944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:48,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:48,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:24:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038743646] [2022-04-28 11:24:48,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:48,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:24:48,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:48,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:24:48,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:48,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:24:48,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:24:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:24:48,343 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:24:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:52,597 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2022-04-28 11:24:52,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:24:52,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:24:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:24:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-04-28 11:24:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:24:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-04-28 11:24:52,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 142 transitions. [2022-04-28 11:24:52,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:52,763 INFO L225 Difference]: With dead ends: 195 [2022-04-28 11:24:52,763 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 11:24:52,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:24:52,764 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:52,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 360 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 11:24:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 11:24:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2022-04-28 11:24:52,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:52,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:24:52,935 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:24:52,935 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:24:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:52,938 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2022-04-28 11:24:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-04-28 11:24:52,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:52,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:52,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 193 states. [2022-04-28 11:24:52,939 INFO L87 Difference]: Start difference. First operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 193 states. [2022-04-28 11:24:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:52,942 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2022-04-28 11:24:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-04-28 11:24:52,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:52,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:52,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:52,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:24:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2022-04-28 11:24:52,946 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 162 [2022-04-28 11:24:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:52,946 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2022-04-28 11:24:52,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:24:52,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 190 transitions. [2022-04-28 11:24:58,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 188 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-04-28 11:24:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-28 11:24:58,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:58,133 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:58,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:58,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 11:24:58,343 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 1 times [2022-04-28 11:24:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:58,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1114474818] [2022-04-28 11:24:58,574 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:58,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 2 times [2022-04-28 11:24:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:58,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206360344] [2022-04-28 11:24:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:58,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:58,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496662441] [2022-04-28 11:24:58,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:58,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:58,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:58,583 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:58,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:24:58,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:58,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:58,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 11:24:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:58,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:01,441 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:25:01,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {23308#true} call ULTIMATE.init(); {23308#true} is VALID [2022-04-28 11:25:01,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {23308#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); {23308#true} is VALID [2022-04-28 11:25:01,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23308#true} {23308#true} #84#return; {23308#true} is VALID [2022-04-28 11:25:01,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {23308#true} call #t~ret5 := main(); {23308#true} is VALID [2022-04-28 11:25:01,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {23308#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; {23308#true} is VALID [2022-04-28 11:25:01,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {23308#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23308#true} {23308#true} #60#return; {23308#true} is VALID [2022-04-28 11:25:01,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {23308#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:25:01,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:25:01,516 INFO L272 TraceCheckUtils]: 13: Hoare triple {23346#(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)); {23308#true} is VALID [2022-04-28 11:25:01,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,516 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23308#true} {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:25:01,516 INFO L272 TraceCheckUtils]: 18: Hoare triple {23346#(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)); {23308#true} is VALID [2022-04-28 11:25:01,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,517 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23308#true} {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:25:01,517 INFO L272 TraceCheckUtils]: 23: Hoare triple {23346#(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)); {23308#true} is VALID [2022-04-28 11:25:01,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,518 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23308#true} {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:25:01,518 INFO L272 TraceCheckUtils]: 28: Hoare triple {23346#(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)); {23308#true} is VALID [2022-04-28 11:25:01,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,518 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23308#true} {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:25:01,518 INFO L272 TraceCheckUtils]: 33: Hoare triple {23346#(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)); {23308#true} is VALID [2022-04-28 11:25:01,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,519 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23308#true} {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {23346#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:25:01,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {23346#(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; {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:25:01,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:25:01,520 INFO L272 TraceCheckUtils]: 40: Hoare triple {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,521 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23308#true} {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:25:01,521 INFO L272 TraceCheckUtils]: 45: Hoare triple {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,521 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {23308#true} {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:25:01,521 INFO L272 TraceCheckUtils]: 50: Hoare triple {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,522 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23308#true} {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:25:01,522 INFO L272 TraceCheckUtils]: 55: Hoare triple {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) 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)); {23308#true} is VALID [2022-04-28 11:25:01,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,523 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23308#true} {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:25:01,523 INFO L272 TraceCheckUtils]: 60: Hoare triple {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,524 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23308#true} {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:25:01,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {23428#(and (<= 1 main_~n~0) (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= 6 (+ main_~y~0 (* (- 1) 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; {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:25:01,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} assume !false; {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:25:01,525 INFO L272 TraceCheckUtils]: 67: Hoare triple {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,525 INFO L290 TraceCheckUtils]: 68: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,526 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23308#true} {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #62#return; {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:25:01,526 INFO L272 TraceCheckUtils]: 72: Hoare triple {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,526 INFO L290 TraceCheckUtils]: 73: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,526 INFO L290 TraceCheckUtils]: 74: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,526 INFO L290 TraceCheckUtils]: 75: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,527 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {23308#true} {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #64#return; {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:25:01,527 INFO L272 TraceCheckUtils]: 77: Hoare triple {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,527 INFO L290 TraceCheckUtils]: 78: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,527 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23308#true} {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #66#return; {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:25:01,528 INFO L272 TraceCheckUtils]: 82: Hoare triple {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,528 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23308#true} {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #68#return; {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:25:01,528 INFO L272 TraceCheckUtils]: 87: Hoare triple {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,528 INFO L290 TraceCheckUtils]: 88: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,528 INFO L290 TraceCheckUtils]: 89: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,529 INFO L290 TraceCheckUtils]: 90: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,529 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23308#true} {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} #70#return; {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 12)))} is VALID [2022-04-28 11:25:01,530 INFO L290 TraceCheckUtils]: 92: Hoare triple {23510#(and (= (+ main_~z~0 (- 6)) (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 18)) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 1) (<= 2 main_~n~0) (= 6 (+ (* (- 2) main_~z~0) (* (- 1) main_~x~0) (* main_~y~0 2) 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; {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:25:01,530 INFO L290 TraceCheckUtils]: 93: Hoare triple {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} assume !false; {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:25:01,530 INFO L272 TraceCheckUtils]: 94: Hoare triple {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,530 INFO L290 TraceCheckUtils]: 95: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,531 INFO L290 TraceCheckUtils]: 96: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,531 INFO L290 TraceCheckUtils]: 97: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,531 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23308#true} {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #62#return; {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:25:01,531 INFO L272 TraceCheckUtils]: 99: Hoare triple {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,531 INFO L290 TraceCheckUtils]: 100: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,531 INFO L290 TraceCheckUtils]: 101: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,531 INFO L290 TraceCheckUtils]: 102: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,532 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23308#true} {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #64#return; {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:25:01,532 INFO L272 TraceCheckUtils]: 104: Hoare triple {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,532 INFO L290 TraceCheckUtils]: 105: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,532 INFO L290 TraceCheckUtils]: 106: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,532 INFO L290 TraceCheckUtils]: 107: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,532 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23308#true} {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #66#return; {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:25:01,533 INFO L272 TraceCheckUtils]: 109: Hoare triple {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,533 INFO L290 TraceCheckUtils]: 110: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,533 INFO L290 TraceCheckUtils]: 111: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,533 INFO L290 TraceCheckUtils]: 112: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,533 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23308#true} {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #68#return; {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:25:01,533 INFO L272 TraceCheckUtils]: 114: Hoare triple {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,533 INFO L290 TraceCheckUtils]: 115: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,533 INFO L290 TraceCheckUtils]: 116: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,533 INFO L290 TraceCheckUtils]: 117: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,534 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {23308#true} {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} #70#return; {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 12))} is VALID [2022-04-28 11:25:01,535 INFO L290 TraceCheckUtils]: 119: Hoare triple {23592#(and (<= 3 main_~n~0) (= (+ (* (- 2) main_~z~0) main_~y~0 12) 1) (= main_~x~0 (+ (* main_~z~0 (- 5)) 36 (* main_~y~0 3))) (= (+ main_~z~0 (- 12)) 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; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,535 INFO L290 TraceCheckUtils]: 120: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} assume !false; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,535 INFO L272 TraceCheckUtils]: 121: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,535 INFO L290 TraceCheckUtils]: 122: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,535 INFO L290 TraceCheckUtils]: 123: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,535 INFO L290 TraceCheckUtils]: 124: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,536 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {23308#true} {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #62#return; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,536 INFO L272 TraceCheckUtils]: 126: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,536 INFO L290 TraceCheckUtils]: 127: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,536 INFO L290 TraceCheckUtils]: 128: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,536 INFO L290 TraceCheckUtils]: 129: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,537 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {23308#true} {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #64#return; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,537 INFO L272 TraceCheckUtils]: 131: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,537 INFO L290 TraceCheckUtils]: 132: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,537 INFO L290 TraceCheckUtils]: 133: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,537 INFO L290 TraceCheckUtils]: 134: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,537 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23308#true} {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #66#return; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,538 INFO L272 TraceCheckUtils]: 136: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~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)); {23308#true} is VALID [2022-04-28 11:25:01,538 INFO L290 TraceCheckUtils]: 137: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,538 INFO L290 TraceCheckUtils]: 138: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,538 INFO L290 TraceCheckUtils]: 139: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,538 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23308#true} {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #68#return; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,538 INFO L272 TraceCheckUtils]: 141: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,538 INFO L290 TraceCheckUtils]: 142: Hoare triple {23308#true} ~cond := #in~cond; {23744#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:01,539 INFO L290 TraceCheckUtils]: 143: Hoare triple {23744#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:01,539 INFO L290 TraceCheckUtils]: 144: Hoare triple {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:01,539 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #70#return; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,540 INFO L290 TraceCheckUtils]: 146: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} assume !(~n~0 <= ~a~0); {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,540 INFO L272 TraceCheckUtils]: 147: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,540 INFO L290 TraceCheckUtils]: 148: Hoare triple {23308#true} ~cond := #in~cond; {23308#true} is VALID [2022-04-28 11:25:01,540 INFO L290 TraceCheckUtils]: 149: Hoare triple {23308#true} assume !(0 == ~cond); {23308#true} is VALID [2022-04-28 11:25:01,540 INFO L290 TraceCheckUtils]: 150: Hoare triple {23308#true} assume true; {23308#true} is VALID [2022-04-28 11:25:01,541 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23308#true} {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #72#return; {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} is VALID [2022-04-28 11:25:01,541 INFO L272 TraceCheckUtils]: 152: Hoare triple {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,541 INFO L290 TraceCheckUtils]: 153: Hoare triple {23308#true} ~cond := #in~cond; {23744#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:01,541 INFO L290 TraceCheckUtils]: 154: Hoare triple {23744#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:01,542 INFO L290 TraceCheckUtils]: 155: Hoare triple {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:01,542 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} {23674#(and (<= 3 main_~a~0) (= (+ 30 main_~y~0 (* main_~z~0 (- 3))) 1) (= (+ main_~z~0 (- 18)) 12) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) (+ 84 (* main_~y~0 3) (* main_~z~0 (- 8)))))} #74#return; {23788#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-28 11:25:01,542 INFO L272 TraceCheckUtils]: 157: Hoare triple {23788#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {23308#true} is VALID [2022-04-28 11:25:01,543 INFO L290 TraceCheckUtils]: 158: Hoare triple {23308#true} ~cond := #in~cond; {23744#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:01,543 INFO L290 TraceCheckUtils]: 159: Hoare triple {23744#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:01,543 INFO L290 TraceCheckUtils]: 160: Hoare triple {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:01,544 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23748#(not (= |__VERIFIER_assert_#in~cond| 0))} {23788#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #76#return; {23804#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0))} is VALID [2022-04-28 11:25:01,545 INFO L272 TraceCheckUtils]: 162: Hoare triple {23804#(and (= (+ 29 main_~y~0) (* main_~z~0 3)) (= (+ main_~x~0 (* main_~z~0 9)) (+ 90 (* main_~y~0 4))) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {23808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:25:01,550 INFO L290 TraceCheckUtils]: 163: Hoare triple {23808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:01,550 INFO L290 TraceCheckUtils]: 164: Hoare triple {23812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23309#false} is VALID [2022-04-28 11:25:01,550 INFO L290 TraceCheckUtils]: 165: Hoare triple {23309#false} assume !false; {23309#false} is VALID [2022-04-28 11:25:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2022-04-28 11:25:01,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:25:30,079 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:25:42,976 WARN L232 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:25:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206360344] [2022-04-28 11:25:47,745 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496662441] [2022-04-28 11:25:47,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496662441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:25:47,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:25:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:25:47,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1114474818] [2022-04-28 11:25:47,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1114474818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:47,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:25:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163863228] [2022-04-28 11:25:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:47,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) Word has length 166 [2022-04-28 11:25:47,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:47,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:25:47,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:47,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:25:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:25:47,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:25:47,847 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:25:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:50,850 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2022-04-28 11:25:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:25:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) Word has length 166 [2022-04-28 11:25:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:25:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-28 11:25:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:25:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-28 11:25:50,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 118 transitions. [2022-04-28 11:25:50,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:50,982 INFO L225 Difference]: With dead ends: 198 [2022-04-28 11:25:50,982 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 11:25:50,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:25:50,983 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:50,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 202 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 11:25:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 11:25:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-28 11:25:51,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:51,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:25:51,167 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:25:51,167 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:25:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:51,170 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2022-04-28 11:25:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2022-04-28 11:25:51,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:51,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:51,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 186 states. [2022-04-28 11:25:51,170 INFO L87 Difference]: Start difference. First operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 186 states. [2022-04-28 11:25:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:51,173 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2022-04-28 11:25:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2022-04-28 11:25:51,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:51,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:51,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:51,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:25:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 195 transitions. [2022-04-28 11:25:51,176 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 195 transitions. Word has length 166 [2022-04-28 11:25:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:51,176 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 195 transitions. [2022-04-28 11:25:51,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2022-04-28 11:25:51,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 195 transitions. [2022-04-28 11:25:56,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 193 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2022-04-28 11:25:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-28 11:25:56,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:25:56,457 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:25:56,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 11:25:56,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 11:25:56,673 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:25:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:25:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 23 times [2022-04-28 11:25:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:56,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536112248] [2022-04-28 11:25:56,907 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:25:56,907 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:25:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 24 times [2022-04-28 11:25:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:25:56,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309524826] [2022-04-28 11:25:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:25:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:25:56,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:25:56,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788246342] [2022-04-28 11:25:56,916 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:25:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:25:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:25:56,917 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:25:56,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 11:25:57,015 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:25:57,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:25:57,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:25:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:25:57,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:57,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {25112#true} call ULTIMATE.init(); {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {25112#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); {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25112#true} {25112#true} #84#return; {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {25112#true} call #t~ret5 := main(); {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L272 TraceCheckUtils]: 6: Hoare triple {25112#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25112#true} {25112#true} #60#return; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {25112#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L272 TraceCheckUtils]: 13: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L272 TraceCheckUtils]: 18: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:25:57,654 INFO L272 TraceCheckUtils]: 23: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L272 TraceCheckUtils]: 28: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L272 TraceCheckUtils]: 33: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,655 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L272 TraceCheckUtils]: 40: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L272 TraceCheckUtils]: 45: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L272 TraceCheckUtils]: 50: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L272 TraceCheckUtils]: 55: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L272 TraceCheckUtils]: 60: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:25:57,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L272 TraceCheckUtils]: 67: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L272 TraceCheckUtils]: 72: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 74: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 75: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L272 TraceCheckUtils]: 77: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 78: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,658 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L272 TraceCheckUtils]: 82: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 84: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 85: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L272 TraceCheckUtils]: 87: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 88: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 89: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 90: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 93: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L272 TraceCheckUtils]: 94: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 96: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 97: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L272 TraceCheckUtils]: 99: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 100: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 102: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L272 TraceCheckUtils]: 104: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 105: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 106: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L290 TraceCheckUtils]: 107: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:25:57,660 INFO L272 TraceCheckUtils]: 109: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 111: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 112: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L272 TraceCheckUtils]: 114: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 115: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 116: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 117: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 119: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 120: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L272 TraceCheckUtils]: 121: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 122: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 123: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,661 INFO L290 TraceCheckUtils]: 124: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L272 TraceCheckUtils]: 126: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 127: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 128: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 129: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L272 TraceCheckUtils]: 131: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 132: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 133: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 134: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L272 TraceCheckUtils]: 136: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 137: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 138: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,662 INFO L290 TraceCheckUtils]: 139: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L272 TraceCheckUtils]: 141: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 142: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 143: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 144: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 146: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 147: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L272 TraceCheckUtils]: 148: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 149: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 150: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L290 TraceCheckUtils]: 151: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:25:57,663 INFO L272 TraceCheckUtils]: 153: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L290 TraceCheckUtils]: 154: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L290 TraceCheckUtils]: 155: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L290 TraceCheckUtils]: 156: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L272 TraceCheckUtils]: 158: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L290 TraceCheckUtils]: 159: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L290 TraceCheckUtils]: 160: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L290 TraceCheckUtils]: 161: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L272 TraceCheckUtils]: 163: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,664 INFO L290 TraceCheckUtils]: 164: Hoare triple {25112#true} ~cond := #in~cond; {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:57,665 INFO L290 TraceCheckUtils]: 165: Hoare triple {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,665 INFO L290 TraceCheckUtils]: 166: Hoare triple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,666 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} {25112#true} #68#return; {25620#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:25:57,666 INFO L272 TraceCheckUtils]: 168: Hoare triple {25620#(= (+ (* main_~x~0 18) (* main_~y~0 12) 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)); {25112#true} is VALID [2022-04-28 11:25:57,666 INFO L290 TraceCheckUtils]: 169: Hoare triple {25112#true} ~cond := #in~cond; {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:57,666 INFO L290 TraceCheckUtils]: 170: Hoare triple {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,666 INFO L290 TraceCheckUtils]: 171: Hoare triple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,667 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} {25620#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #70#return; {25636#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:25:57,671 INFO L290 TraceCheckUtils]: 173: Hoare triple {25636#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 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; {25636#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:25:57,672 INFO L290 TraceCheckUtils]: 174: Hoare triple {25636#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !false; {25636#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:25:57,672 INFO L272 TraceCheckUtils]: 175: Hoare triple {25636#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* 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)); {25112#true} is VALID [2022-04-28 11:25:57,672 INFO L290 TraceCheckUtils]: 176: Hoare triple {25112#true} ~cond := #in~cond; {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:57,672 INFO L290 TraceCheckUtils]: 177: Hoare triple {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,672 INFO L290 TraceCheckUtils]: 178: Hoare triple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,676 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} {25636#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #62#return; {25658#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} is VALID [2022-04-28 11:25:57,676 INFO L272 TraceCheckUtils]: 180: Hoare triple {25658#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:25:57,676 INFO L290 TraceCheckUtils]: 181: Hoare triple {25112#true} ~cond := #in~cond; {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:57,676 INFO L290 TraceCheckUtils]: 182: Hoare triple {25609#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,677 INFO L290 TraceCheckUtils]: 183: Hoare triple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:57,679 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} {25658#(and (= (+ (* (+ (* main_~n~0 6) 6) (+ (* main_~n~0 6) 6)) 12) (+ (* main_~y~0 12) 36 (* main_~n~0 36))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~n~0 12) (* (+ (* main_~n~0 6) 6) main_~y~0) 12)))} #64#return; {25674#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} is VALID [2022-04-28 11:25:57,679 INFO L272 TraceCheckUtils]: 185: Hoare triple {25674#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:25:57,683 INFO L290 TraceCheckUtils]: 186: Hoare triple {25678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:57,684 INFO L290 TraceCheckUtils]: 187: Hoare triple {25682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25113#false} is VALID [2022-04-28 11:25:57,684 INFO L290 TraceCheckUtils]: 188: Hoare triple {25113#false} assume !false; {25113#false} is VALID [2022-04-28 11:25:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 430 proven. 4 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2022-04-28 11:25:57,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:29:26,759 INFO L290 TraceCheckUtils]: 188: Hoare triple {25113#false} assume !false; {25113#false} is VALID [2022-04-28 11:29:26,760 INFO L290 TraceCheckUtils]: 187: Hoare triple {25682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25113#false} is VALID [2022-04-28 11:29:26,760 INFO L290 TraceCheckUtils]: 186: Hoare triple {25678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:29:26,760 INFO L272 TraceCheckUtils]: 185: Hoare triple {25674#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:29:26,761 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} {25701#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} #64#return; {25674#(= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18))} is VALID [2022-04-28 11:29:26,761 INFO L290 TraceCheckUtils]: 183: Hoare triple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:26,762 INFO L290 TraceCheckUtils]: 182: Hoare triple {25711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:26,762 INFO L290 TraceCheckUtils]: 181: Hoare triple {25112#true} ~cond := #in~cond; {25711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:29:26,762 INFO L272 TraceCheckUtils]: 180: Hoare triple {25701#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,357 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} #62#return; {25701#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} is VALID [2022-04-28 11:29:28,357 INFO L290 TraceCheckUtils]: 178: Hoare triple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:28,357 INFO L290 TraceCheckUtils]: 177: Hoare triple {25711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:28,358 INFO L290 TraceCheckUtils]: 176: Hoare triple {25112#true} ~cond := #in~cond; {25711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:29:28,358 INFO L272 TraceCheckUtils]: 175: Hoare triple {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,358 INFO L290 TraceCheckUtils]: 174: Hoare triple {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} assume !false; {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:29:28,484 INFO L290 TraceCheckUtils]: 173: Hoare triple {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 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; {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:29:28,485 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25112#true} {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} #70#return; {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:29:28,485 INFO L290 TraceCheckUtils]: 171: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,485 INFO L290 TraceCheckUtils]: 170: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,485 INFO L290 TraceCheckUtils]: 169: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,485 INFO L272 TraceCheckUtils]: 168: Hoare triple {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,665 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} {25112#true} #68#return; {25718#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (* (div (+ main_~z~0 (- 6)) 6) 3) 1) main_~y~0)) (= (* main_~x~0 18) (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 18)))} is VALID [2022-04-28 11:29:28,666 INFO L290 TraceCheckUtils]: 166: Hoare triple {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:28,666 INFO L290 TraceCheckUtils]: 165: Hoare triple {25711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:28,666 INFO L290 TraceCheckUtils]: 164: Hoare triple {25112#true} ~cond := #in~cond; {25711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:29:28,666 INFO L272 TraceCheckUtils]: 163: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,666 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:29:28,666 INFO L290 TraceCheckUtils]: 161: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 160: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 159: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L272 TraceCheckUtils]: 158: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 156: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 155: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 154: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L272 TraceCheckUtils]: 153: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 151: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 150: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 149: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L272 TraceCheckUtils]: 148: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,667 INFO L290 TraceCheckUtils]: 147: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 146: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 144: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 143: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 142: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L272 TraceCheckUtils]: 141: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 139: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 138: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 137: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L272 TraceCheckUtils]: 136: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 134: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 133: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,668 INFO L290 TraceCheckUtils]: 132: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L272 TraceCheckUtils]: 131: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 129: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 128: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 127: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L272 TraceCheckUtils]: 126: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 124: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 123: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 122: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L272 TraceCheckUtils]: 121: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 120: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 119: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:29:28,669 INFO L290 TraceCheckUtils]: 117: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 116: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 115: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L272 TraceCheckUtils]: 114: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 112: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 111: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 110: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L272 TraceCheckUtils]: 109: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 107: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 106: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L290 TraceCheckUtils]: 105: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L272 TraceCheckUtils]: 104: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,670 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 102: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 101: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 100: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L272 TraceCheckUtils]: 99: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 97: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 96: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 95: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L272 TraceCheckUtils]: 94: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 93: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 92: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 90: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 89: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,671 INFO L290 TraceCheckUtils]: 88: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,687 INFO L272 TraceCheckUtils]: 87: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,687 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:29:28,687 INFO L290 TraceCheckUtils]: 85: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,687 INFO L290 TraceCheckUtils]: 84: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,687 INFO L290 TraceCheckUtils]: 83: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,687 INFO L272 TraceCheckUtils]: 82: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,687 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 80: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 79: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L272 TraceCheckUtils]: 77: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L272 TraceCheckUtils]: 72: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L272 TraceCheckUtils]: 67: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L272 TraceCheckUtils]: 60: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L272 TraceCheckUtils]: 55: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L272 TraceCheckUtils]: 50: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L272 TraceCheckUtils]: 45: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L272 TraceCheckUtils]: 40: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:29:28,690 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25112#true} {25112#true} #70#return; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L272 TraceCheckUtils]: 33: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25112#true} {25112#true} #68#return; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L272 TraceCheckUtils]: 28: Hoare triple {25112#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25112#true} {25112#true} #66#return; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L272 TraceCheckUtils]: 23: Hoare triple {25112#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,691 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25112#true} {25112#true} #64#return; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L272 TraceCheckUtils]: 18: Hoare triple {25112#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25112#true} {25112#true} #62#return; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L272 TraceCheckUtils]: 13: Hoare triple {25112#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {25112#true} assume !false; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {25112#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25112#true} {25112#true} #60#return; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {25112#true} assume !(0 == ~cond); {25112#true} is VALID [2022-04-28 11:29:28,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {25112#true} ~cond := #in~cond; {25112#true} is VALID [2022-04-28 11:29:28,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {25112#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {25112#true} is VALID [2022-04-28 11:29:28,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {25112#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; {25112#true} is VALID [2022-04-28 11:29:28,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {25112#true} call #t~ret5 := main(); {25112#true} is VALID [2022-04-28 11:29:28,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25112#true} {25112#true} #84#return; {25112#true} is VALID [2022-04-28 11:29:28,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {25112#true} assume true; {25112#true} is VALID [2022-04-28 11:29:28,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {25112#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); {25112#true} is VALID [2022-04-28 11:29:28,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {25112#true} call ULTIMATE.init(); {25112#true} is VALID [2022-04-28 11:29:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 353 proven. 6 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2022-04-28 11:29:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:29:28,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309524826] [2022-04-28 11:29:28,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:29:28,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788246342] [2022-04-28 11:29:28,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788246342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:29:28,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:29:28,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:29:28,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:29:28,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536112248] [2022-04-28 11:29:28,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536112248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:29:28,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:29:28,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:29:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859019577] [2022-04-28 11:29:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:29:28,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 189 [2022-04-28 11:29:28,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:29:28,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:29:28,742 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-28 11:29:28,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:29:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:29:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:29:28,742 INFO L87 Difference]: Start difference. First operand 186 states and 195 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:29:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:31,324 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-04-28 11:29:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:29:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 189 [2022-04-28 11:29:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:29:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:29:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 11:29:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:29:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 11:29:31,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 11:29:31,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:31,920 INFO L225 Difference]: With dead ends: 190 [2022-04-28 11:29:31,920 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:29:31,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 362 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:29:31,921 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:29:31,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 112 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 11:29:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:29:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:29:31,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:29:31,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:29:31,922 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:29:31,922 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:29:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:31,922 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:29:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:29:31,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:31,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:31,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:29:31,922 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:29:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:31,922 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:29:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:29:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:31,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:31,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:29:31,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:29:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:29:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:29:31,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2022-04-28 11:29:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:29:31,923 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:29:31,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:29:31,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:29:31,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:29:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:31,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:29:31,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 11:29:32,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:29:32,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:29:53,983 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:29:53,984 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:29:53,984 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:29:53,984 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 50) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-28 11:29:53,984 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 56) the Hoare annotation is: true [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) .cse1) (= main_~y~0 (+ main_~x~0 6))) (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse2 main_~a~0)) (<= main_~a~0 50) (= main_~x~0 (* .cse2 .cse2 .cse2)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)))) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) .cse1) (= main_~y~0 (+ main_~x~0 6))) (let ((.cse2 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse2 main_~a~0)) (<= main_~a~0 50) (= main_~x~0 (* .cse2 .cse2 .cse2)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse2 (+ main_~a~0 1)))) (and (= (+ main_~x~0 10) main_~z~0) .cse0 (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:29:53,984 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 50) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-28 11:29:53,985 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 56) the Hoare annotation is: true [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L38(lines 33 46) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:29:53,985 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-28 11:29:53,985 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= main_~a~0 50) (<= 0 main_~a~0)) [2022-04-28 11:29:53,985 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse2 (+ main_~z~0 main_~x~0))) (or (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse0 main_~a~0)) (<= main_~a~0 50) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse1 (<= 0 main_~a~0) (<= .cse0 (+ main_~a~0 1)) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))))) (and (= main_~x~0 0) (= main_~y~0 1) .cse1 (= main_~z~0 6)) (and .cse1 (= main_~x~0 1) (= (+ main_~y~0 6) .cse2) (= main_~y~0 (+ main_~x~0 6))) (and (= (+ main_~x~0 10) main_~z~0) .cse1 (= (+ 7 main_~y~0) .cse2) (= main_~x~0 8)))) [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 50) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))))) [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 50) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (= (+ (* main_~n~0 12) (* (* main_~n~0 main_~y~0) 6) 6) (+ (* main_~x~0 18) (* main_~y~0 6))) (= (* main_~y~0 12) (+ (* 36 (* main_~n~0 main_~n~0)) 12 (* main_~n~0 36)))) [2022-04-28 11:29:53,985 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:29:53,985 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:29:53,986 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:29:53,986 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:29:53,986 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:29:53,986 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:29:53,986 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:29:53,986 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:29:53,986 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:29:53,986 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:29:53,986 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:29:53,986 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:29:53,986 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:29:53,988 INFO L356 BasicCegarLoop]: Path program histogram: [24, 6, 6, 2, 2, 2, 2, 2, 2] [2022-04-28 11:29:53,989 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:29:53,991 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:29:53,999 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:29:57,704 INFO L163 areAnnotationChecker]: CFG has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:29:57,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:29:57 BoogieIcfgContainer [2022-04-28 11:29:57,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:29:57,724 INFO L158 Benchmark]: Toolchain (without parser) took 658913.54ms. Allocated memory was 205.5MB in the beginning and 388.0MB in the end (delta: 182.5MB). Free memory was 157.1MB in the beginning and 261.7MB in the end (delta: -104.6MB). Peak memory consumption was 213.6MB. Max. memory is 8.0GB. [2022-04-28 11:29:57,724 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory was 173.7MB in the beginning and 173.6MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:29:57,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.70ms. Allocated memory is still 205.5MB. Free memory was 156.9MB in the beginning and 180.8MB in the end (delta: -23.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:29:57,725 INFO L158 Benchmark]: Boogie Preprocessor took 39.91ms. Allocated memory is still 205.5MB. Free memory was 180.8MB in the beginning and 179.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:29:57,725 INFO L158 Benchmark]: RCFGBuilder took 226.44ms. Allocated memory is still 205.5MB. Free memory was 179.4MB in the beginning and 167.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:29:57,726 INFO L158 Benchmark]: TraceAbstraction took 658394.05ms. Allocated memory was 205.5MB in the beginning and 388.0MB in the end (delta: 182.5MB). Free memory was 167.4MB in the beginning and 261.7MB in the end (delta: -94.3MB). Peak memory consumption was 224.4MB. Max. memory is 8.0GB. [2022-04-28 11:29:57,726 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.13ms. Allocated memory is still 205.5MB. Free memory was 173.7MB in the beginning and 173.6MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.70ms. Allocated memory is still 205.5MB. Free memory was 156.9MB in the beginning and 180.8MB in the end (delta: -23.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.91ms. Allocated memory is still 205.5MB. Free memory was 180.8MB in the beginning and 179.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.44ms. Allocated memory is still 205.5MB. Free memory was 179.4MB in the beginning and 167.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 658394.05ms. Allocated memory was 205.5MB in the beginning and 388.0MB in the end (delta: 182.5MB). Free memory was 167.4MB in the beginning and 261.7MB in the end (delta: -94.3MB). Peak memory consumption was 224.4MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 654.6s, OverallIterations: 24, TraceHistogramMax: 33, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 109.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 65.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 4243 SdHoareTripleChecker+Invalid, 65.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 39 IncrementalHoareTripleChecker+Unchecked, 3061 mSDsCounter, 376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5624 IncrementalHoareTripleChecker+Invalid, 6058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 376 mSolverCounterUnsat, 1182 mSDtfsCounter, 5624 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3693 GetRequests, 3410 SyntacticMatches, 28 SemanticMatches, 255 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=23, InterpolantAutomatonStates: 184, 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, 24 MinimizatonAttempts, 97 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 510 PreInvPairs, 776 NumberOfFragments, 1078 HoareAnnotationTreeSize, 510 FomulaSimplifications, 7049 FormulaSimplificationTreeSizeReduction, 4.2s HoareSimplificationTime, 36 FomulaSimplificationsInter, 304669 FormulaSimplificationTreeSizeReductionInter, 17.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((n <= a + 1 && a <= 50) && n * 6 + 6 == z) && 0 <= a) && n * 12 + n * y * 6 + 6 == x * 18 + y * 6) && y * 12 == 36 * (n * n) + 12 + n * 36 - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond || !(1 <= \old(cond))) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:29:57,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...