/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:13:48,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:13:48,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:13:48,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:13:48,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:13:48,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:13:48,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:13:48,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:13:48,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:13:48,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:13:48,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:13:48,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:13:48,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:13:48,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:13:48,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:13:48,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:13:48,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:13:48,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:13:48,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:13:48,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:13:48,354 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:13:48,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:13:48,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:13:48,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:13:48,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:13:48,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:13:48,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:13:48,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:13:48,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:13:48,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:13:48,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:13:48,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:13:48,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:13:48,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:13:48,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:13:48,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:13:48,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:13:48,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:13:48,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:13:48,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:13:48,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:13:48,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:13:48,383 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:13:48,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:13:48,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:13:48,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:13:48,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:13:48,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:13:48,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:13:48,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:13:48,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:13:48,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:13:48,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:13:48,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:13:48,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:13:48,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:13:48,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:13:48,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:13:48,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:13:48,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:13:48,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:13:48,398 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:13:48,398 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:13:48,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:13:48,398 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:13:48,398 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:13:48,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:13:48,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:13:48,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:13:48,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:13:48,671 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:13:48,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-28 11:13:48,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6bfba52/5b3974c668cb4639ad2f158aa790a4b3/FLAGd9748a982 [2022-04-28 11:13:49,140 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:13:49,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-28 11:13:49,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6bfba52/5b3974c668cb4639ad2f158aa790a4b3/FLAGd9748a982 [2022-04-28 11:13:49,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6bfba52/5b3974c668cb4639ad2f158aa790a4b3 [2022-04-28 11:13:49,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:13:49,541 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:13:49,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:13:49,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:13:49,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:13:49,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:13:49" (1/1) ... [2022-04-28 11:13:49,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413e1fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:49, skipping insertion in model container [2022-04-28 11:13:49,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:13:49" (1/1) ... [2022-04-28 11:13:49,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:13:49,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:13:49,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-04-28 11:13:49,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:13:49,972 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:13:49,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-04-28 11:13:50,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:13:50,028 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:13:50,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50 WrapperNode [2022-04-28 11:13:50,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:13:50,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:13:50,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:13:50,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:13:50,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:13:50,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:13:50,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:13:50,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:13:50,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (1/1) ... [2022-04-28 11:13:50,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:13:50,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:50,107 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:13:50,133 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:13:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:13:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:13:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:13:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:13:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:13:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:13:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:13:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:13:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:13:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:13:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:13:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:13:50,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:13:50,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:13:50,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:13:50,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:13:50,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:13:50,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:13:50,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:13:50,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:13:50,217 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:13:50,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:13:50,376 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:13:50,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:13:50,402 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:13:50,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:13:50 BoogieIcfgContainer [2022-04-28 11:13:50,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:13:50,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:13:50,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:13:50,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:13:50,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:13:49" (1/3) ... [2022-04-28 11:13:50,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d459400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:13:50, skipping insertion in model container [2022-04-28 11:13:50,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:13:50" (2/3) ... [2022-04-28 11:13:50,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d459400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:13:50, skipping insertion in model container [2022-04-28 11:13:50,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:13:50" (3/3) ... [2022-04-28 11:13:50,427 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound5.c [2022-04-28 11:13:50,439 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:13:50,439 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:13:50,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:13:50,507 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@5e0e0a74, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@646b5f9 [2022-04-28 11:13:50,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:13:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 11:13:50,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:50,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:50,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:50,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-28 11:13:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:50,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837890320] [2022-04-28 11:13:50,553 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-28 11:13:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:50,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361056622] [2022-04-28 11:13:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:50,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:13:50,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:13:50,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:13:50,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:50,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 11:13:50,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 11:13:50,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-28 11:13:50,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 11:13:50,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-28 11:13:50,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 11:13:50,788 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-28 11:13:50,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 11:13:50,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 11:13:50,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 11:13:50,789 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:13:50,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:50,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361056622] [2022-04-28 11:13:50,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361056622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:50,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:50,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:13:50,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837890320] [2022-04-28 11:13:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837890320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:50,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:13:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52290822] [2022-04-28 11:13:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 11:13:50,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:50,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:50,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:50,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:13:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:50,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:13:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:13:50,851 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,103 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-28 11:13:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:13:51,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 11:13:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:13:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 11:13:51,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 11:13:51,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,260 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:13:51,260 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 11:13:51,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:13:51,266 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:51,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 11:13:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 11:13:51,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:51,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,296 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,296 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,300 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:13:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:13:51,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:13:51,302 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-28 11:13:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,306 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-28 11:13:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-28 11:13:51,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:51,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-28 11:13:51,312 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-28 11:13:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:51,312 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-28 11:13:51,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-28 11:13:51,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-28 11:13:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:13:51,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:51,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:51,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:13:51,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-28 11:13:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:51,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1079490161] [2022-04-28 11:13:51,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:51,357 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-28 11:13:51,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:51,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442358512] [2022-04-28 11:13:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:51,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:51,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:51,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= ~counter~0 0)} is VALID [2022-04-28 11:13:51,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-28 11:13:51,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {263#false} is VALID [2022-04-28 11:13:51,460 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-28 11:13:51,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 11:13:51,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 11:13:51,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 11:13:51,461 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:13:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442358512] [2022-04-28 11:13:51,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442358512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:51,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:51,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:13:51,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:51,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1079490161] [2022-04-28 11:13:51,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1079490161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:51,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:51,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:13:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212436186] [2022-04-28 11:13:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:51,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:51,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:51,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:51,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:51,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:51,477 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,744 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 11:13:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:51,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:13:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-28 11:13:51,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-28 11:13:51,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,813 INFO L225 Difference]: With dead ends: 40 [2022-04-28 11:13:51,813 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 11:13:51,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:51,816 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:51,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 11:13:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 11:13:51,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:51,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,828 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,828 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,834 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:13:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:51,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:13:51,843 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-28 11:13:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:51,846 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 11:13:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:51,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:51,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:51,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:51,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 11:13:51,854 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-28 11:13:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:51,854 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 11:13:51,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:51,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 11:13:51,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 11:13:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 11:13:51,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:51,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:51,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:13:51,899 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-28 11:13:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:51,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2114582176] [2022-04-28 11:13:51,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-28 11:13:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:51,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572435279] [2022-04-28 11:13:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:51,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:13:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:51,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:13:51,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:13:51,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:13:51,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:13:51,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-28 11:13:51,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 11:13:51,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-28 11:13:51,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-28 11:13:52,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:52,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:52,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 5);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:13:52,002 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:13:52,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:13:52,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-28 11:13:52,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-28 11:13:52,005 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:13:52,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:52,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572435279] [2022-04-28 11:13:52,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572435279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:52,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:52,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:52,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:52,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2114582176] [2022-04-28 11:13:52,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2114582176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:52,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:52,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828311841] [2022-04-28 11:13:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:52,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:52,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:52,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:52,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:52,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:52,020 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:52,495 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-28 11:13:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:13:52,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 11:13:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:13:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 11:13:52,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 11:13:52,543 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:13:52,544 INFO L225 Difference]: With dead ends: 34 [2022-04-28 11:13:52,544 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 11:13:52,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:13:52,546 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:52,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 11:13:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 11:13:52,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:52,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:52,552 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:52,552 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:52,554 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:52,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:52,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:52,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:13:52,555 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 11:13:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:52,557 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 11:13:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:52,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:52,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:52,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:52,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:13:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 11:13:52,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 11:13:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:52,559 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 11:13:52,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 11:13:52,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 11:13:52,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 11:13:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:13:52,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:52,621 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:52,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 11:13:52,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-28 11:13:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:52,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28167940] [2022-04-28 11:13:52,623 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-28 11:13:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:52,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491419777] [2022-04-28 11:13:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:52,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:52,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306488003] [2022-04-28 11:13:52,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:52,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:52,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:52,670 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:13:52,687 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:13:52,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:52,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:52,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:52,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:52,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-28 11:13:52,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {681#true} is VALID [2022-04-28 11:13:52,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:52,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-28 11:13:52,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-28 11:13:52,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:52,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:52,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:52,885 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-28 11:13:52,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-28 11:13:52,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-28 11:13:52,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-28 11:13:52,887 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:13:52,888 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(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)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:52,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:52,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-28 11:13:52,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-28 11:13:52,892 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:13:52,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:52,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491419777] [2022-04-28 11:13:52,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:52,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306488003] [2022-04-28 11:13:52,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306488003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:52,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:52,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:52,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28167940] [2022-04-28 11:13:52,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28167940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:52,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:52,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946318510] [2022-04-28 11:13:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:52,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:13:52,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:52,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:52,915 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:13:52,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:52,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:52,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:52,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:52,916 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:53,173 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-28 11:13:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 11:13:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:53,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:53,250 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:13:53,252 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:13:53,252 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 11:13:53,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:13:53,253 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:53,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 11:13:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-28 11:13:53,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:53,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:53,267 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:53,267 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:53,270 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:53,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:53,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:53,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:13:53,272 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 11:13:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:53,274 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-28 11:13:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-28 11:13:53,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:53,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:53,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:53,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 11:13:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-28 11:13:53,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-28 11:13:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:53,277 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-28 11:13:53,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:13:53,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-28 11:13:53,330 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:13:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-28 11:13:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:13:53,331 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:53,331 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:53,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:13:53,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:53,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:53,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-28 11:13:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:53,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1031065830] [2022-04-28 11:13:53,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-28 11:13:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:53,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036221237] [2022-04-28 11:13:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:53,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:53,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30319008] [2022-04-28 11:13:53,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:53,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:53,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:53,565 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:13:53,567 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:13:53,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:53,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:53,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:53,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:53,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 11:13:53,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1010#true} is VALID [2022-04-28 11:13:53,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:53,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-28 11:13:53,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-28 11:13:53,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:53,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:53,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:53,733 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-28 11:13:53,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:53,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:53,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:53,735 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:53,735 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(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)); {1010#true} is VALID [2022-04-28 11:13:53,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-28 11:13:53,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-28 11:13:53,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 11:13:53,736 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:13:53,737 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(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)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:53,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:53,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 11:13:53,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 11:13:53,738 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:13:53,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:53,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:53,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036221237] [2022-04-28 11:13:53,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:53,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30319008] [2022-04-28 11:13:53,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30319008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:53,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:53,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:53,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:53,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1031065830] [2022-04-28 11:13:53,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1031065830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:53,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:53,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328650010] [2022-04-28 11:13:53,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:13:53,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:53,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:53,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:53,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:53,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:53,760 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:54,028 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:13:54,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:54,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:13:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:13:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:54,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:54,096 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:13:54,098 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:13:54,098 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:13:54,098 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:13:54,099 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:54,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:13:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 11:13:54,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:54,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:54,116 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:54,117 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:54,120 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:54,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:54,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:54,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:13:54,121 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-28 11:13:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:54,124 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:13:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:13:54,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:54,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:54,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:54,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-28 11:13:54,127 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-28 11:13:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:54,127 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-28 11:13:54,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:13:54,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-28 11:13:54,209 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:13:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-28 11:13:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:13:54,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:54,210 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] [2022-04-28 11:13:54,235 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:13:54,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:54,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-28 11:13:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:54,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922676040] [2022-04-28 11:13:54,434 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:13:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-28 11:13:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:54,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528332463] [2022-04-28 11:13:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:54,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:54,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341900347] [2022-04-28 11:13:54,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:54,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:54,456 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:13:54,457 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:13:54,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:54,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:54,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:13:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:54,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:54,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-28 11:13:54,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#true} is VALID [2022-04-28 11:13:54,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:54,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-28 11:13:54,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-28 11:13:54,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:54,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:54,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:54,654 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-28 11:13:54,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:54,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:54,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:54,655 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:54,655 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-28 11:13:54,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:54,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:54,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:54,656 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:54,657 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(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)); {1390#true} is VALID [2022-04-28 11:13:54,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-28 11:13:54,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-28 11:13:54,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-28 11:13:54,659 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:54,660 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(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)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:54,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:54,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-28 11:13:54,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-28 11:13:54,661 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:13:54,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:13:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:54,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528332463] [2022-04-28 11:13:54,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:54,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341900347] [2022-04-28 11:13:54,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341900347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:54,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:54,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:54,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:54,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922676040] [2022-04-28 11:13:54,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922676040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:54,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:54,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704077150] [2022-04-28 11:13:54,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:54,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:13:54,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:54,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:54,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:54,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:13:54,684 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:55,021 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-28 11:13:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:13:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:13:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 11:13:55,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 11:13:55,096 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:13:55,099 INFO L225 Difference]: With dead ends: 62 [2022-04-28 11:13:55,099 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 11:13:55,099 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:13:55,101 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:55,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 11:13:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 11:13:55,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:55,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:55,136 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:55,138 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:55,141 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:55,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:55,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:55,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:13:55,143 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-28 11:13:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:55,145 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 11:13:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:55,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:55,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:55,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:55,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 11:13:55,150 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-28 11:13:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:55,151 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 11:13:55,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:13:55,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 11:13:55,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 11:13:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:55,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:55,220 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:55,247 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:13:55,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:55,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-28 11:13:55,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:55,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496448531] [2022-04-28 11:13:55,880 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:55,880 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 2 times [2022-04-28 11:13:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:55,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338470751] [2022-04-28 11:13:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:55,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:55,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834803612] [2022-04-28 11:13:55,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:55,898 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:13:55,926 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:13:55,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:55,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:55,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:13:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:55,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:56,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:56,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:56,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#(<= ~counter~0 0)} assume true; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:56,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#(<= ~counter~0 0)} {1801#true} #81#return; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:56,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(<= ~counter~0 0)} call #t~ret6 := main(); {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:56,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1809#(<= ~counter~0 0)} is VALID [2022-04-28 11:13:56,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,181 INFO L272 TraceCheckUtils]: 8: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,184 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #59#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,187 INFO L272 TraceCheckUtils]: 13: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,189 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #61#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,189 INFO L272 TraceCheckUtils]: 18: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,191 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #63#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,192 INFO L272 TraceCheckUtils]: 23: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,193 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #65#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,194 INFO L272 TraceCheckUtils]: 28: Hoare triple {1825#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(<= ~counter~0 1)} ~cond := #in~cond; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {1825#(<= ~counter~0 1)} assume !(0 == ~cond); {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {1825#(<= ~counter~0 1)} assume true; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,195 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1825#(<= ~counter~0 1)} {1825#(<= ~counter~0 1)} #67#return; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {1825#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1825#(<= ~counter~0 1)} is VALID [2022-04-28 11:13:56,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {1825#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1910#(<= |main_#t~post5| 1)} is VALID [2022-04-28 11:13:56,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {1910#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:56,197 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:56,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:56,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {1802#false} assume !(0 == ~cond); {1802#false} is VALID [2022-04-28 11:13:56,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {1802#false} assume true; {1802#false} is VALID [2022-04-28 11:13:56,198 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1802#false} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:56,198 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:56,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:56,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:56,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 11:13:56,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:56,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {1802#false} assume !false; {1802#false} is VALID [2022-04-28 11:13:56,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {1802#false} assume 0 == ~cond; {1802#false} is VALID [2022-04-28 11:13:56,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {1802#false} ~cond := #in~cond; {1802#false} is VALID [2022-04-28 11:13:56,425 INFO L272 TraceCheckUtils]: 41: Hoare triple {1802#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1802#false} is VALID [2022-04-28 11:13:56,425 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1801#true} {1802#false} #69#return; {1802#false} is VALID [2022-04-28 11:13:56,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:56,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:56,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:56,425 INFO L272 TraceCheckUtils]: 36: Hoare triple {1802#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:56,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1802#false} is VALID [2022-04-28 11:13:56,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {1972#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1968#(< |main_#t~post5| 5)} is VALID [2022-04-28 11:13:56,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#(< ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,427 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1801#true} {1972#(< ~counter~0 5)} #67#return; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:56,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:56,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:56,428 INFO L272 TraceCheckUtils]: 28: Hoare triple {1972#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:56,428 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1801#true} {1972#(< ~counter~0 5)} #65#return; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:56,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:56,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:56,429 INFO L272 TraceCheckUtils]: 23: Hoare triple {1972#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:56,430 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1801#true} {1972#(< ~counter~0 5)} #63#return; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:56,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:56,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:56,431 INFO L272 TraceCheckUtils]: 18: Hoare triple {1972#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:56,435 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1801#true} {1972#(< ~counter~0 5)} #61#return; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:56,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:56,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:56,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {1972#(< ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:56,439 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1801#true} {1972#(< ~counter~0 5)} #59#return; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {1801#true} assume true; {1801#true} is VALID [2022-04-28 11:13:56,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#true} assume !(0 == ~cond); {1801#true} is VALID [2022-04-28 11:13:56,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#true} ~cond := #in~cond; {1801#true} is VALID [2022-04-28 11:13:56,440 INFO L272 TraceCheckUtils]: 8: Hoare triple {1972#(< ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1801#true} is VALID [2022-04-28 11:13:56,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {2057#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1972#(< ~counter~0 5)} is VALID [2022-04-28 11:13:56,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(< ~counter~0 4)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2057#(< ~counter~0 4)} is VALID [2022-04-28 11:13:56,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#(< ~counter~0 4)} call #t~ret6 := main(); {2057#(< ~counter~0 4)} is VALID [2022-04-28 11:13:56,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#(< ~counter~0 4)} {1801#true} #81#return; {2057#(< ~counter~0 4)} is VALID [2022-04-28 11:13:56,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#(< ~counter~0 4)} assume true; {2057#(< ~counter~0 4)} is VALID [2022-04-28 11:13:56,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2057#(< ~counter~0 4)} is VALID [2022-04-28 11:13:56,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {1801#true} call ULTIMATE.init(); {1801#true} is VALID [2022-04-28 11:13:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:56,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338470751] [2022-04-28 11:13:56,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:56,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834803612] [2022-04-28 11:13:56,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834803612] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:56,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:56,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 11:13:56,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:56,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496448531] [2022-04-28 11:13:56,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496448531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:56,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:56,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:13:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486208420] [2022-04-28 11:13:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:56,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:56,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:56,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:56,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:56,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:13:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:56,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:13:56,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:13:56,471 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:56,782 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-28 11:13:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 11:13:56,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-28 11:13:56,851 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:13:56,853 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:13:56,853 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:13:56,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:13:56,854 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:56,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:13:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:13:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 11:13:56,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:56,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:56,894 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:56,894 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:56,896 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:56,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:56,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:56,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:13:56,897 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-28 11:13:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:56,899 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 11:13:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:56,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:56,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:56,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:56,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:13:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-28 11:13:56,902 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-28 11:13:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:56,903 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-28 11:13:56,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:56,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-28 11:13:56,978 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:13:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-28 11:13:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 11:13:56,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:56,979 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:57,008 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:13:57,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:57,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-28 11:13:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:57,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1632572453] [2022-04-28 11:13:57,552 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:57,552 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:57,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 2 times [2022-04-28 11:13:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:57,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74442367] [2022-04-28 11:13:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:57,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:57,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132021052] [2022-04-28 11:13:57,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:13:57,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:57,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:57,565 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:13:57,575 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:13:57,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:13:57,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:57,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:13:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:57,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:13:57,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:13:57,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-28 11:13:57,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:57,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:13:57,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:13:57,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,865 INFO L272 TraceCheckUtils]: 8: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:13:57,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:57,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:57,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:57,866 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,866 INFO L272 TraceCheckUtils]: 13: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:13:57,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:57,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:57,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:57,867 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,867 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:13:57,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:57,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:57,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:57,868 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,868 INFO L272 TraceCheckUtils]: 23: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:13:57,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:57,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:57,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:57,869 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,869 INFO L272 TraceCheckUtils]: 28: Hoare triple {2468#(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)); {2448#true} is VALID [2022-04-28 11:13:57,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:57,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:57,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:57,870 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2468#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:13:57,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {2468#(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; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:57,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:57,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:57,872 INFO L272 TraceCheckUtils]: 36: Hoare triple {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2448#true} is VALID [2022-04-28 11:13:57,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:57,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:57,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:57,873 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {2553#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:13:57,873 INFO L272 TraceCheckUtils]: 41: Hoare triple {2553#(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)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:57,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:57,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:13:57,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:13:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:57,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:13:58,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 11:13:58,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {2582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 11:13:58,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:13:58,075 INFO L272 TraceCheckUtils]: 41: Hoare triple {2598#(= (+ (* 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)); {2578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:13:58,076 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2448#true} {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:58,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:58,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:58,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:58,076 INFO L272 TraceCheckUtils]: 36: Hoare triple {2598#(= (+ (* 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)); {2448#true} is VALID [2022-04-28 11:13:58,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 5);havoc #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:58,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:58,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {2623#(= (+ (* 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; {2598#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:13:58,085 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #67#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:58,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:58,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:58,086 INFO L272 TraceCheckUtils]: 28: Hoare triple {2623#(= (+ (* 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)); {2448#true} is VALID [2022-04-28 11:13:58,086 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #65#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:58,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:58,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:58,087 INFO L272 TraceCheckUtils]: 23: Hoare triple {2623#(= (+ (* 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)); {2448#true} is VALID [2022-04-28 11:13:58,088 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #63#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:58,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:58,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:58,088 INFO L272 TraceCheckUtils]: 18: Hoare triple {2623#(= (+ (* 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)); {2448#true} is VALID [2022-04-28 11:13:58,088 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #61#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:58,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:58,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:58,089 INFO L272 TraceCheckUtils]: 13: Hoare triple {2623#(= (+ (* 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)); {2448#true} is VALID [2022-04-28 11:13:58,089 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2448#true} {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #59#return; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:58,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {2448#true} assume !(0 == ~cond); {2448#true} is VALID [2022-04-28 11:13:58,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#true} ~cond := #in~cond; {2448#true} is VALID [2022-04-28 11:13:58,090 INFO L272 TraceCheckUtils]: 8: Hoare triple {2623#(= (+ (* 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)); {2448#true} is VALID [2022-04-28 11:13:58,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2623#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:13:58,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret6 := main(); {2448#true} is VALID [2022-04-28 11:13:58,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #81#return; {2448#true} is VALID [2022-04-28 11:13:58,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 11:13:58,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2448#true} is VALID [2022-04-28 11:13:58,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 11:13:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:13:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:13:58,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74442367] [2022-04-28 11:13:58,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:13:58,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132021052] [2022-04-28 11:13:58,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132021052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:13:58,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:13:58,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:13:58,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:13:58,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1632572453] [2022-04-28 11:13:58,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1632572453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:13:58,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:13:58,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:13:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598868379] [2022-04-28 11:13:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:13:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:58,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:13:58,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:58,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:58,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:13:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:58,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:13:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:13:58,120 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:58,566 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-28 11:13:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:13:58,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2022-04-28 11:13:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:13:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-28 11:13:58,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-28 11:13:58,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:58,654 INFO L225 Difference]: With dead ends: 78 [2022-04-28 11:13:58,654 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 11:13:58,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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:13:58,655 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:13:58,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:13:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 11:13:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-04-28 11:13:58,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:13:58,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:58,711 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:58,711 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:58,715 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:58,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:58,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:58,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:13:58,726 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-04-28 11:13:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:13:58,729 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 11:13:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 11:13:58,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:13:58,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:13:58,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:13:58,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:13:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 11:13:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-04-28 11:13:58,732 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 45 [2022-04-28 11:13:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:13:58,732 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-04-28 11:13:58,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:13:58,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 77 transitions. [2022-04-28 11:13:58,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:13:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:13:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:13:58,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:13:58,831 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:13:58,850 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:13:59,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:59,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:13:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:13:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 3 times [2022-04-28 11:13:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:13:59,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118143856] [2022-04-28 11:13:59,368 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:13:59,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:13:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 4 times [2022-04-28 11:13:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:13:59,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094007262] [2022-04-28 11:13:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:13:59,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:13:59,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:13:59,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739926704] [2022-04-28 11:13:59,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:13:59,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:13:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:13:59,381 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:13:59,407 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:13:59,449 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:13:59,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:13:59,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 11:13:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:13:59,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:00,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:14:00,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-28 11:14:00,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:00,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:14:00,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:14:00,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-28 11:14:00,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:14:00,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 5);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:14:00,162 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:00,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:00,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:00,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:00,163 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:14:00,163 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:00,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:00,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:00,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:00,167 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #61#return; {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:00,167 INFO L272 TraceCheckUtils]: 18: Hoare triple {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:00,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:00,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:00,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:00,169 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3225#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:00,169 INFO L272 TraceCheckUtils]: 23: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:00,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:00,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:00,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:00,172 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:00,172 INFO L272 TraceCheckUtils]: 28: Hoare triple {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:00,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:00,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:00,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:00,174 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:02,191 WARN L290 TraceCheckUtils]: 33: Hoare triple {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-28 11:14:02,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:02,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:02,193 INFO L272 TraceCheckUtils]: 36: Hoare triple {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:02,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:02,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:02,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:02,194 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3257#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:02,195 INFO L272 TraceCheckUtils]: 41: Hoare triple {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:02,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:02,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {3214#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:02,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:02,197 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3241#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:02,197 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* 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)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:02,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:02,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:14:02,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:14:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-04-28 11:14:02,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:03,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2022-04-28 11:14:03,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {3320#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3168#false} is VALID [2022-04-28 11:14:03,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:03,139 INFO L272 TraceCheckUtils]: 46: Hoare triple {3312#(= (* 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)); {3316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:03,140 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {3312#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:03,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:03,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:03,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:03,141 INFO L272 TraceCheckUtils]: 41: Hoare triple {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:03,142 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {3339#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:03,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:03,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:03,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:03,143 INFO L272 TraceCheckUtils]: 36: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:03,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:03,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:03,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:03,151 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3167#true} {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:03,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:03,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:03,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:03,152 INFO L272 TraceCheckUtils]: 28: Hoare triple {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:03,159 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} {3167#true} #65#return; {3356#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:14:03,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:03,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3218#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:03,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#true} ~cond := #in~cond; {3349#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:03,160 INFO L272 TraceCheckUtils]: 23: Hoare triple {3167#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:03,160 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3167#true} {3167#true} #63#return; {3167#true} is VALID [2022-04-28 11:14:03,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:03,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:03,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3167#true} {3167#true} #61#return; {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3167#true} {3167#true} #59#return; {3167#true} is VALID [2022-04-28 11:14:03,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#true} assume !(0 == ~cond); {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#true} assume !!(#t~post5 < 5);havoc #t~post5; {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2022-04-28 11:14:03,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#true} {3167#true} #81#return; {3167#true} is VALID [2022-04-28 11:14:03,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#true} assume true; {3167#true} is VALID [2022-04-28 11:14:03,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {3167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#true} is VALID [2022-04-28 11:14:03,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2022-04-28 11:14:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 11:14:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:03,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094007262] [2022-04-28 11:14:03,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:03,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739926704] [2022-04-28 11:14:03,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739926704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:03,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:03,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-28 11:14:03,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:03,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118143856] [2022-04-28 11:14:03,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118143856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:03,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:03,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:14:03,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545384939] [2022-04-28 11:14:03,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:03,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:14:03,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:03,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:05,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:05,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:14:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:14:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:14:05,199 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:10,335 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:14:12,337 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:14:14,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:14:18,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:14:20,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:14:22,612 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:14:24,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:14:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:24,873 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-04-28 11:14:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:24,874 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-28 11:14:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:14:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 11:14:24,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 11:14:26,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:26,939 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:14:26,939 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 11:14:26,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:14:26,940 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:26,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 136 Invalid, 5 Unknown, 0 Unchecked, 13.8s Time] [2022-04-28 11:14:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 11:14:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 11:14:26,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:26,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:26,995 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:26,996 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:26,998 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 11:14:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:14:26,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:26,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:26,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-28 11:14:26,999 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-28 11:14:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:27,001 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-28 11:14:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:14:27,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:27,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:27,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:27,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:14:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-04-28 11:14:27,005 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 50 [2022-04-28 11:14:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:27,005 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-04-28 11:14:27,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:14:27,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 76 transitions. [2022-04-28 11:14:29,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-28 11:14:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 11:14:29,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:29,111 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:29,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 11:14:29,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:29,316 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-28 11:14:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:29,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118838903] [2022-04-28 11:14:29,604 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:29,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 2 times [2022-04-28 11:14:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:29,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620921776] [2022-04-28 11:14:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:29,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:29,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274900770] [2022-04-28 11:14:29,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:29,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:29,619 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:14:29,621 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:14:29,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:29,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:29,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:14:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:29,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:30,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {3899#true} call ULTIMATE.init(); {3899#true} is VALID [2022-04-28 11:14:30,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {3899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3899#true} is VALID [2022-04-28 11:14:30,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3899#true} {3899#true} #81#return; {3899#true} is VALID [2022-04-28 11:14:30,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {3899#true} call #t~ret6 := main(); {3899#true} is VALID [2022-04-28 11:14:30,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {3899#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,204 INFO L272 TraceCheckUtils]: 8: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:14:30,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,205 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,206 INFO L272 TraceCheckUtils]: 13: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:14:30,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,206 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,206 INFO L272 TraceCheckUtils]: 18: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:14:30,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,207 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,207 INFO L272 TraceCheckUtils]: 23: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:14:30,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,208 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,208 INFO L272 TraceCheckUtils]: 28: Hoare triple {3919#(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)); {3899#true} is VALID [2022-04-28 11:14:30,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,209 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3899#true} {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3919#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:30,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {3919#(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; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,211 INFO L272 TraceCheckUtils]: 36: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {3899#true} is VALID [2022-04-28 11:14:30,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,212 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #59#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,212 INFO L272 TraceCheckUtils]: 41: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {3899#true} is VALID [2022-04-28 11:14:30,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,213 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #61#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,213 INFO L272 TraceCheckUtils]: 46: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {3899#true} is VALID [2022-04-28 11:14:30,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,214 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #63#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,214 INFO L272 TraceCheckUtils]: 51: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {3899#true} is VALID [2022-04-28 11:14:30,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,215 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #65#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,215 INFO L272 TraceCheckUtils]: 56: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {3899#true} is VALID [2022-04-28 11:14:30,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,216 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3899#true} {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #67#return; {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:30,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {4004#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4089#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:30,217 INFO L272 TraceCheckUtils]: 62: Hoare triple {4089#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {3899#true} is VALID [2022-04-28 11:14:30,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-04-28 11:14:30,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-04-28 11:14:30,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-04-28 11:14:30,217 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3899#true} {4089#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4089#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:30,218 INFO L272 TraceCheckUtils]: 67: Hoare triple {4089#(and (= (+ main_~z~0 (- 6)) 6) (= 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)); {4108#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:30,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {4108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:30,219 INFO L290 TraceCheckUtils]: 69: Hoare triple {4112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3900#false} is VALID [2022-04-28 11:14:30,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {3900#false} assume !false; {3900#false} is VALID [2022-04-28 11:14:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:30,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:30,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:30,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620921776] [2022-04-28 11:14:30,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:30,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274900770] [2022-04-28 11:14:30,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274900770] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:30,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:30,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:30,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:30,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118838903] [2022-04-28 11:14:30,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118838903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:30,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:30,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888066164] [2022-04-28 11:14:30,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:30,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:14:30,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:30,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:30,679 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:14:30,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:30,679 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:31,221 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-28 11:14:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 71 [2022-04-28 11:14:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:14:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:14:31,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-28 11:14:31,297 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:14:31,299 INFO L225 Difference]: With dead ends: 86 [2022-04-28 11:14:31,299 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:14:31,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 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:14:31,300 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:31,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:14:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:14:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-28 11:14:31,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:31,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:14:31,370 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:14:31,370 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:14:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:31,373 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 11:14:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 11:14:31,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:31,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:31,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 84 states. [2022-04-28 11:14:31,374 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 84 states. [2022-04-28 11:14:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:31,377 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 11:14:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 11:14:31,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:31,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:31,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:31,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:14:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-04-28 11:14:31,380 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 71 [2022-04-28 11:14:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:31,381 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-04-28 11:14:31,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:31,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 94 transitions. [2022-04-28 11:14:33,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-04-28 11:14:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 11:14:33,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:33,540 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:33,558 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:14:33,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:33,741 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 3 times [2022-04-28 11:14:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:33,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [312131673] [2022-04-28 11:14:34,030 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:34,030 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 4 times [2022-04-28 11:14:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:34,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037116490] [2022-04-28 11:14:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:34,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:34,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761901547] [2022-04-28 11:14:34,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:34,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:34,053 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:14:34,083 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:14:34,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:34,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:34,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:14:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:34,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:34,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2022-04-28 11:14:34,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {4746#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:34,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#(<= ~counter~0 0)} assume true; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:34,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4754#(<= ~counter~0 0)} {4746#true} #81#return; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:34,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {4754#(<= ~counter~0 0)} call #t~ret6 := main(); {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:34,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {4754#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4754#(<= ~counter~0 0)} is VALID [2022-04-28 11:14:34,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {4754#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {4770#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,409 INFO L272 TraceCheckUtils]: 8: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,411 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #59#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,411 INFO L272 TraceCheckUtils]: 13: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,419 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #61#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,420 INFO L272 TraceCheckUtils]: 18: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,421 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #63#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,422 INFO L272 TraceCheckUtils]: 23: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,424 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #65#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,424 INFO L272 TraceCheckUtils]: 28: Hoare triple {4770#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {4770#(<= ~counter~0 1)} ~cond := #in~cond; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {4770#(<= ~counter~0 1)} assume !(0 == ~cond); {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {4770#(<= ~counter~0 1)} assume true; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,425 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4770#(<= ~counter~0 1)} {4770#(<= ~counter~0 1)} #67#return; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {4770#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4770#(<= ~counter~0 1)} is VALID [2022-04-28 11:14:34,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {4770#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {4855#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,427 INFO L272 TraceCheckUtils]: 36: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,428 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #59#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,429 INFO L272 TraceCheckUtils]: 41: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,430 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #61#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,432 INFO L272 TraceCheckUtils]: 46: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,436 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #63#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,437 INFO L272 TraceCheckUtils]: 51: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,439 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #65#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,439 INFO L272 TraceCheckUtils]: 56: Hoare triple {4855#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {4855#(<= ~counter~0 2)} ~cond := #in~cond; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {4855#(<= ~counter~0 2)} assume !(0 == ~cond); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,441 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4855#(<= ~counter~0 2)} {4855#(<= ~counter~0 2)} #67#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {4855#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {4855#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4940#(<= |main_#t~post5| 2)} is VALID [2022-04-28 11:14:34,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {4940#(<= |main_#t~post5| 2)} assume !(#t~post5 < 5);havoc #t~post5; {4747#false} is VALID [2022-04-28 11:14:34,442 INFO L272 TraceCheckUtils]: 64: Hoare triple {4747#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4747#false} is VALID [2022-04-28 11:14:34,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-28 11:14:34,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {4747#false} assume !(0 == ~cond); {4747#false} is VALID [2022-04-28 11:14:34,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {4747#false} assume true; {4747#false} is VALID [2022-04-28 11:14:34,443 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4747#false} {4747#false} #69#return; {4747#false} is VALID [2022-04-28 11:14:34,443 INFO L272 TraceCheckUtils]: 69: Hoare triple {4747#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4747#false} is VALID [2022-04-28 11:14:34,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-28 11:14:34,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {4747#false} assume 0 == ~cond; {4747#false} is VALID [2022-04-28 11:14:34,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2022-04-28 11:14:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 60 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-28 11:14:34,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:34,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2022-04-28 11:14:34,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {4747#false} assume 0 == ~cond; {4747#false} is VALID [2022-04-28 11:14:34,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {4747#false} ~cond := #in~cond; {4747#false} is VALID [2022-04-28 11:14:34,720 INFO L272 TraceCheckUtils]: 69: Hoare triple {4747#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4747#false} is VALID [2022-04-28 11:14:34,720 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4746#true} {4747#false} #69#return; {4747#false} is VALID [2022-04-28 11:14:34,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,721 INFO L272 TraceCheckUtils]: 64: Hoare triple {4747#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {4998#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {4747#false} is VALID [2022-04-28 11:14:34,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {5002#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4998#(< |main_#t~post5| 5)} is VALID [2022-04-28 11:14:34,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {5002#(< ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,722 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4746#true} {5002#(< ~counter~0 5)} #67#return; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,722 INFO L272 TraceCheckUtils]: 56: Hoare triple {5002#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,723 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4746#true} {5002#(< ~counter~0 5)} #65#return; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,723 INFO L272 TraceCheckUtils]: 51: Hoare triple {5002#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,724 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4746#true} {5002#(< ~counter~0 5)} #63#return; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,724 INFO L272 TraceCheckUtils]: 46: Hoare triple {5002#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,724 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4746#true} {5002#(< ~counter~0 5)} #61#return; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,725 INFO L272 TraceCheckUtils]: 41: Hoare triple {5002#(< ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,725 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4746#true} {5002#(< ~counter~0 5)} #59#return; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,725 INFO L272 TraceCheckUtils]: 36: Hoare triple {5002#(< ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {5002#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {5087#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5002#(< ~counter~0 5)} is VALID [2022-04-28 11:14:34,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {5087#(< ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,727 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4746#true} {5087#(< ~counter~0 4)} #67#return; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,727 INFO L272 TraceCheckUtils]: 28: Hoare triple {5087#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,728 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4746#true} {5087#(< ~counter~0 4)} #65#return; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,728 INFO L272 TraceCheckUtils]: 23: Hoare triple {5087#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,729 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4746#true} {5087#(< ~counter~0 4)} #63#return; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,729 INFO L272 TraceCheckUtils]: 18: Hoare triple {5087#(< ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,729 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4746#true} {5087#(< ~counter~0 4)} #61#return; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,730 INFO L272 TraceCheckUtils]: 13: Hoare triple {5087#(< ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,730 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4746#true} {5087#(< ~counter~0 4)} #59#return; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {4746#true} assume true; {4746#true} is VALID [2022-04-28 11:14:34,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2022-04-28 11:14:34,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2022-04-28 11:14:34,730 INFO L272 TraceCheckUtils]: 8: Hoare triple {5087#(< ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4746#true} is VALID [2022-04-28 11:14:34,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {5087#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {4855#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5087#(< ~counter~0 4)} is VALID [2022-04-28 11:14:34,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {4855#(<= ~counter~0 2)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {4855#(<= ~counter~0 2)} call #t~ret6 := main(); {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4855#(<= ~counter~0 2)} {4746#true} #81#return; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {4855#(<= ~counter~0 2)} assume true; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {4746#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4855#(<= ~counter~0 2)} is VALID [2022-04-28 11:14:34,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2022-04-28 11:14:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:34,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037116490] [2022-04-28 11:14:34,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:34,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761901547] [2022-04-28 11:14:34,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761901547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:34,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:34,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 11:14:34,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [312131673] [2022-04-28 11:14:34,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [312131673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:34,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:34,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716924328] [2022-04-28 11:14:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:34,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:14:34,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:34,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:34,769 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:14:34,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:34,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:34,770 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:35,232 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-04-28 11:14:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:14:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2022-04-28 11:14:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 11:14:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 11:14:35,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-28 11:14:35,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:35,315 INFO L225 Difference]: With dead ends: 114 [2022-04-28 11:14:35,315 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 11:14:35,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:14:35,316 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:35,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 11:14:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-28 11:14:35,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:35,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:35,436 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:35,436 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:35,439 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:14:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:14:35,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:35,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:35,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:14:35,440 INFO L87 Difference]: Start difference. First operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:14:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:35,442 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:14:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:14:35,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:35,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:35,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:35,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.087719298245614) internal successors, (62), 59 states have internal predecessors, (62), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-04-28 11:14:35,446 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 73 [2022-04-28 11:14:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:35,446 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-04-28 11:14:35,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:14:35,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 109 transitions. [2022-04-28 11:14:37,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 108 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-04-28 11:14:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:14:37,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:37,612 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:37,628 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:14:37,812 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,SelfDestructingSolverStorable10 [2022-04-28 11:14:37,812 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-28 11:14:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:37,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1544999025] [2022-04-28 11:14:38,120 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:38,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 2 times [2022-04-28 11:14:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813184047] [2022-04-28 11:14:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:38,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:38,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980279272] [2022-04-28 11:14:38,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:38,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:38,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:38,148 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:14:38,174 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:14:38,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:38,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:38,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:14:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:38,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:38,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {5820#true} call ULTIMATE.init(); {5820#true} is VALID [2022-04-28 11:14:38,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {5820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5820#true} is VALID [2022-04-28 11:14:38,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5820#true} {5820#true} #81#return; {5820#true} is VALID [2022-04-28 11:14:38,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {5820#true} call #t~ret6 := main(); {5820#true} is VALID [2022-04-28 11:14:38,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {5820#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 5);havoc #t~post5; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,849 INFO L272 TraceCheckUtils]: 8: Hoare triple {5840#(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)); {5820#true} is VALID [2022-04-28 11:14:38,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,850 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5820#true} {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,850 INFO L272 TraceCheckUtils]: 13: Hoare triple {5840#(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)); {5820#true} is VALID [2022-04-28 11:14:38,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,851 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5820#true} {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,851 INFO L272 TraceCheckUtils]: 18: Hoare triple {5840#(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)); {5820#true} is VALID [2022-04-28 11:14:38,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,852 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5820#true} {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,852 INFO L272 TraceCheckUtils]: 23: Hoare triple {5840#(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)); {5820#true} is VALID [2022-04-28 11:14:38,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,853 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5820#true} {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,853 INFO L272 TraceCheckUtils]: 28: Hoare triple {5840#(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)); {5820#true} is VALID [2022-04-28 11:14:38,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,854 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5820#true} {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {5840#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:38,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {5840#(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; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,856 INFO L272 TraceCheckUtils]: 36: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5820#true} is VALID [2022-04-28 11:14:38,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,856 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5820#true} {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,857 INFO L272 TraceCheckUtils]: 41: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5820#true} is VALID [2022-04-28 11:14:38,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,857 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5820#true} {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,857 INFO L272 TraceCheckUtils]: 46: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5820#true} is VALID [2022-04-28 11:14:38,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,858 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5820#true} {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,859 INFO L272 TraceCheckUtils]: 51: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5820#true} is VALID [2022-04-28 11:14:38,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,859 INFO L290 TraceCheckUtils]: 53: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,860 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5820#true} {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,860 INFO L272 TraceCheckUtils]: 56: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5820#true} is VALID [2022-04-28 11:14:38,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,861 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5820#true} {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:38,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {5925#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:38,861 INFO L272 TraceCheckUtils]: 62: Hoare triple {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5820#true} is VALID [2022-04-28 11:14:38,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,862 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5820#true} {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:38,862 INFO L272 TraceCheckUtils]: 67: Hoare triple {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {5820#true} is VALID [2022-04-28 11:14:38,863 INFO L290 TraceCheckUtils]: 68: Hoare triple {5820#true} ~cond := #in~cond; {5820#true} is VALID [2022-04-28 11:14:38,863 INFO L290 TraceCheckUtils]: 69: Hoare triple {5820#true} assume !(0 == ~cond); {5820#true} is VALID [2022-04-28 11:14:38,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {5820#true} assume true; {5820#true} is VALID [2022-04-28 11:14:38,863 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5820#true} {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:38,865 INFO L272 TraceCheckUtils]: 72: Hoare triple {6010#(and (<= 0 main_~a~0) (= (+ main_~z~0 (- 5)) main_~y~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)); {6044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:38,865 INFO L290 TraceCheckUtils]: 73: Hoare triple {6044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:38,866 INFO L290 TraceCheckUtils]: 74: Hoare triple {6048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5821#false} is VALID [2022-04-28 11:14:38,866 INFO L290 TraceCheckUtils]: 75: Hoare triple {5821#false} assume !false; {5821#false} is VALID [2022-04-28 11:14:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:14:38,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:46,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813184047] [2022-04-28 11:14:46,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980279272] [2022-04-28 11:14:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980279272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:46,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:46,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:46,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1544999025] [2022-04-28 11:14:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1544999025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:46,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:46,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36447454] [2022-04-28 11:14:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:46,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:46,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:46,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:46,659 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:14:46,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:46,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:46,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:46,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:46,660 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:47,206 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-28 11:14:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:47,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:14:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 11:14:47,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-28 11:14:47,279 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:14:47,281 INFO L225 Difference]: With dead ends: 104 [2022-04-28 11:14:47,281 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 11:14:47,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:47,282 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:47,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 11:14:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 11:14:47,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:47,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:47,412 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:47,412 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:47,414 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:14:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:14:47,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:47,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:47,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:14:47,415 INFO L87 Difference]: Start difference. First operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 100 states. [2022-04-28 11:14:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:47,417 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-04-28 11:14:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:14:47,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:47,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:47,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:47,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 25 states have call successors, (25), 17 states have call predecessors, (25), 15 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:14:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2022-04-28 11:14:47,420 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 76 [2022-04-28 11:14:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:47,421 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2022-04-28 11:14:47,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:47,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 110 transitions. [2022-04-28 11:14:47,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-04-28 11:14:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:14:47,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:47,708 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:47,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 11:14:47,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:47,912 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 210840414, now seen corresponding path program 1 times [2022-04-28 11:14:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:47,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1235917593] [2022-04-28 11:14:48,188 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:48,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 210840414, now seen corresponding path program 2 times [2022-04-28 11:14:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656809646] [2022-04-28 11:14:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:48,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:48,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826873221] [2022-04-28 11:14:48,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:48,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:48,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:48,199 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:14:48,206 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:14:48,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:48,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:48,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 11:14:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:48,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:56,654 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:14:57,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {6801#true} call ULTIMATE.init(); {6801#true} is VALID [2022-04-28 11:14:57,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {6801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6801#true} is VALID [2022-04-28 11:14:57,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6801#true} {6801#true} #81#return; {6801#true} is VALID [2022-04-28 11:14:57,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {6801#true} call #t~ret6 := main(); {6801#true} is VALID [2022-04-28 11:14:57,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {6801#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,548 INFO L272 TraceCheckUtils]: 8: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,549 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6801#true} {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,549 INFO L272 TraceCheckUtils]: 13: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,550 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6801#true} {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,550 INFO L272 TraceCheckUtils]: 18: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,551 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6801#true} {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,551 INFO L272 TraceCheckUtils]: 23: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,553 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6801#true} {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,553 INFO L272 TraceCheckUtils]: 28: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,554 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6801#true} {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-28 11:14:57,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {6821#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} assume !!(#t~post5 < 5);havoc #t~post5; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,556 INFO L272 TraceCheckUtils]: 36: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,557 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6801#true} {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #59#return; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,557 INFO L272 TraceCheckUtils]: 41: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,558 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6801#true} {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #61#return; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,558 INFO L272 TraceCheckUtils]: 46: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,559 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6801#true} {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #63#return; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,559 INFO L272 TraceCheckUtils]: 51: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {6801#true} ~cond := #in~cond; {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:57,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,560 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #65#return; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,561 INFO L272 TraceCheckUtils]: 56: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6801#true} is VALID [2022-04-28 11:14:57,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {6801#true} ~cond := #in~cond; {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:57,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,562 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} #67#return; {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} is VALID [2022-04-28 11:14:57,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {6906#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)))} assume !(~n~0 <= ~a~0); {6993#(and (= main_~z~0 12) (< main_~a~0 main_~n~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:57,563 INFO L272 TraceCheckUtils]: 62: Hoare triple {6993#(and (= main_~z~0 12) (< main_~a~0 main_~n~0) (= (+ 5 main_~y~0) main_~z~0) (= 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)); {6801#true} is VALID [2022-04-28 11:14:57,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {6801#true} ~cond := #in~cond; {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:57,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,564 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {6993#(and (= main_~z~0 12) (< main_~a~0 main_~n~0) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (= main_~n~0 1))} #69#return; {7009#(and (= main_~z~0 12) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:57,565 INFO L272 TraceCheckUtils]: 67: Hoare triple {7009#(and (= main_~z~0 12) (= (+ 5 main_~y~0) main_~z~0) (= 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)); {6801#true} is VALID [2022-04-28 11:14:57,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {6801#true} ~cond := #in~cond; {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:57,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {6964#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:57,567 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {7009#(and (= main_~z~0 12) (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #71#return; {7025#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} is VALID [2022-04-28 11:14:57,567 INFO L272 TraceCheckUtils]: 72: Hoare triple {7025#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~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)); {6801#true} is VALID [2022-04-28 11:14:57,567 INFO L290 TraceCheckUtils]: 73: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:14:57,567 INFO L290 TraceCheckUtils]: 74: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:14:57,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:14:57,568 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6801#true} {7025#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} #73#return; {7025#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 0))} is VALID [2022-04-28 11:14:57,574 INFO L272 TraceCheckUtils]: 77: Hoare triple {7025#(and (= (+ 5 main_~y~0) main_~z~0) (< (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0) 1) (= main_~x~0 1) (<= 0 (div (+ (* (- 2) main_~x~0) (div (* (- 1) main_~z~0 main_~x~0) (- 6))) main_~x~0)) (= (mod (* (- 1) main_~z~0 main_~x~0) 6) 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)); {7044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:57,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {7044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:57,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {7048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6802#false} is VALID [2022-04-28 11:14:57,576 INFO L290 TraceCheckUtils]: 80: Hoare triple {6802#false} assume !false; {6802#false} is VALID [2022-04-28 11:14:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 118 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-28 11:14:57,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:49,903 INFO L290 TraceCheckUtils]: 80: Hoare triple {6802#false} assume !false; {6802#false} is VALID [2022-04-28 11:15:49,904 INFO L290 TraceCheckUtils]: 79: Hoare triple {7048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6802#false} is VALID [2022-04-28 11:15:49,904 INFO L290 TraceCheckUtils]: 78: Hoare triple {7044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:49,905 INFO L272 TraceCheckUtils]: 77: Hoare triple {7064#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} 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)); {7044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:49,906 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6801#true} {7064#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #73#return; {7064#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:15:49,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,906 INFO L272 TraceCheckUtils]: 72: Hoare triple {7064#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,907 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {7083#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} #71#return; {7064#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:15:49,908 INFO L290 TraceCheckUtils]: 70: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,908 INFO L290 TraceCheckUtils]: 69: Hoare triple {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {6801#true} ~cond := #in~cond; {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:49,909 INFO L272 TraceCheckUtils]: 67: Hoare triple {7083#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,910 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {7100#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} #69#return; {7083#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} is VALID [2022-04-28 11:15:49,910 INFO L290 TraceCheckUtils]: 65: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,910 INFO L290 TraceCheckUtils]: 64: Hoare triple {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {6801#true} ~cond := #in~cond; {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:49,911 INFO L272 TraceCheckUtils]: 62: Hoare triple {7100#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {7116#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {7100#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))))} is VALID [2022-04-28 11:15:49,913 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {7120#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #67#return; {7116#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:15:49,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {6801#true} ~cond := #in~cond; {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:49,914 INFO L272 TraceCheckUtils]: 56: Hoare triple {7120#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~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)); {6801#true} is VALID [2022-04-28 11:15:49,922 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} {6801#true} #65#return; {7120#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (<= main_~n~0 main_~a~0) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:49,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6968#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:49,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {6801#true} ~cond := #in~cond; {7093#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:49,923 INFO L272 TraceCheckUtils]: 51: Hoare triple {6801#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,923 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6801#true} {6801#true} #63#return; {6801#true} is VALID [2022-04-28 11:15:49,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,923 INFO L272 TraceCheckUtils]: 46: Hoare triple {6801#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,923 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6801#true} {6801#true} #61#return; {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L272 TraceCheckUtils]: 41: Hoare triple {6801#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6801#true} {6801#true} #59#return; {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L272 TraceCheckUtils]: 36: Hoare triple {6801#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {6801#true} assume !!(#t~post5 < 5);havoc #t~post5; {6801#true} is VALID [2022-04-28 11:15:49,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {6801#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {6801#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; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6801#true} {6801#true} #67#return; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L272 TraceCheckUtils]: 28: Hoare triple {6801#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6801#true} {6801#true} #65#return; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L272 TraceCheckUtils]: 23: Hoare triple {6801#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6801#true} {6801#true} #63#return; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L272 TraceCheckUtils]: 18: Hoare triple {6801#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6801#true} {6801#true} #61#return; {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L272 TraceCheckUtils]: 13: Hoare triple {6801#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6801#true} {6801#true} #59#return; {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {6801#true} assume !(0 == ~cond); {6801#true} is VALID [2022-04-28 11:15:49,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {6801#true} ~cond := #in~cond; {6801#true} is VALID [2022-04-28 11:15:49,927 INFO L272 TraceCheckUtils]: 8: Hoare triple {6801#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6801#true} is VALID [2022-04-28 11:15:49,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {6801#true} assume !!(#t~post5 < 5);havoc #t~post5; {6801#true} is VALID [2022-04-28 11:15:49,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {6801#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6801#true} is VALID [2022-04-28 11:15:49,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {6801#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6801#true} is VALID [2022-04-28 11:15:49,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {6801#true} call #t~ret6 := main(); {6801#true} is VALID [2022-04-28 11:15:49,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6801#true} {6801#true} #81#return; {6801#true} is VALID [2022-04-28 11:15:49,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {6801#true} assume true; {6801#true} is VALID [2022-04-28 11:15:49,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {6801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6801#true} is VALID [2022-04-28 11:15:49,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {6801#true} call ULTIMATE.init(); {6801#true} is VALID [2022-04-28 11:15:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-28 11:15:49,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:49,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656809646] [2022-04-28 11:15:49,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:49,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826873221] [2022-04-28 11:15:49,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826873221] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:49,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:49,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-28 11:15:49,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:49,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1235917593] [2022-04-28 11:15:49,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1235917593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:49,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:49,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:15:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391603495] [2022-04-28 11:15:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 81 [2022-04-28 11:15:49,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:49,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:15:50,010 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:15:50,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:15:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:15:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:15:50,011 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:15:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:51,445 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-04-28 11:15:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:15:51,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) Word has length 81 [2022-04-28 11:15:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:15:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 11:15:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:15:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 11:15:51,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-28 11:15:51,559 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:15:51,561 INFO L225 Difference]: With dead ends: 102 [2022-04-28 11:15:51,561 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 11:15:51,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:15:51,562 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:51,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 11:15:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 11:15:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 11:15:51,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:51,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:51,672 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:51,672 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:51,674 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-04-28 11:15:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-28 11:15:51,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:51,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:51,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 86 states. [2022-04-28 11:15:51,675 INFO L87 Difference]: Start difference. First operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 86 states. [2022-04-28 11:15:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:51,677 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-04-28 11:15:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-28 11:15:51,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:51,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:51,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:51,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-04-28 11:15:51,680 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 81 [2022-04-28 11:15:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:51,680 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-04-28 11:15:51,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:15:51,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 94 transitions. [2022-04-28 11:15:53,601 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:15:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-04-28 11:15:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 11:15:53,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:53,602 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:53,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 11:15:53,819 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,SelfDestructingSolverStorable12 [2022-04-28 11:15:53,819 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 3 times [2022-04-28 11:15:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:53,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1829248312] [2022-04-28 11:15:54,063 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:54,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash 386595463, now seen corresponding path program 4 times [2022-04-28 11:15:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:54,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731496689] [2022-04-28 11:15:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:54,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:54,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738308661] [2022-04-28 11:15:54,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:54,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:54,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:54,081 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:15:54,082 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:15:54,208 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:54,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:54,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 11:15:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:54,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:54,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {7855#true} call ULTIMATE.init(); {7855#true} is VALID [2022-04-28 11:15:54,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {7855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7855#true} is VALID [2022-04-28 11:15:54,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7855#true} {7855#true} #81#return; {7855#true} is VALID [2022-04-28 11:15:54,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {7855#true} call #t~ret6 := main(); {7855#true} is VALID [2022-04-28 11:15:54,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {7855#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,912 INFO L272 TraceCheckUtils]: 8: Hoare triple {7875#(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)); {7855#true} is VALID [2022-04-28 11:15:54,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,913 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7855#true} {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,913 INFO L272 TraceCheckUtils]: 13: Hoare triple {7875#(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)); {7855#true} is VALID [2022-04-28 11:15:54,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,914 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7855#true} {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,914 INFO L272 TraceCheckUtils]: 18: Hoare triple {7875#(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)); {7855#true} is VALID [2022-04-28 11:15:54,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,915 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7855#true} {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,915 INFO L272 TraceCheckUtils]: 23: Hoare triple {7875#(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)); {7855#true} is VALID [2022-04-28 11:15:54,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,915 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7855#true} {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,915 INFO L272 TraceCheckUtils]: 28: Hoare triple {7875#(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)); {7855#true} is VALID [2022-04-28 11:15:54,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,916 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7855#true} {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {7875#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {7875#(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; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 5);havoc #t~post5; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,917 INFO L272 TraceCheckUtils]: 36: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7855#true} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,918 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7855#true} {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,918 INFO L272 TraceCheckUtils]: 41: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= 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)); {7855#true} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,920 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7855#true} {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,920 INFO L272 TraceCheckUtils]: 46: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7855#true} is VALID [2022-04-28 11:15:54,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,921 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7855#true} {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,921 INFO L272 TraceCheckUtils]: 51: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= 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)); {7855#true} is VALID [2022-04-28 11:15:54,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,922 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7855#true} {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #65#return; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,922 INFO L272 TraceCheckUtils]: 56: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7855#true} is VALID [2022-04-28 11:15:54,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {7855#true} ~cond := #in~cond; {8033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:54,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {8033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,923 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} #67#return; {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:54,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {7960#(and (= main_~z~0 12) (= main_~x~0 1) (= main_~n~0 1) (= main_~y~0 (+ main_~x~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; {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} assume !!(#t~post5 < 5);havoc #t~post5; {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,924 INFO L272 TraceCheckUtils]: 64: Hoare triple {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7855#true} is VALID [2022-04-28 11:15:54,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,925 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7855#true} {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #59#return; {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,925 INFO L272 TraceCheckUtils]: 69: Hoare triple {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7855#true} is VALID [2022-04-28 11:15:54,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,926 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7855#true} {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #61#return; {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,926 INFO L272 TraceCheckUtils]: 74: Hoare triple {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7855#true} is VALID [2022-04-28 11:15:54,926 INFO L290 TraceCheckUtils]: 75: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,926 INFO L290 TraceCheckUtils]: 76: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,926 INFO L290 TraceCheckUtils]: 77: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,931 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7855#true} {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #63#return; {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,932 INFO L272 TraceCheckUtils]: 79: Hoare triple {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= 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)); {7855#true} is VALID [2022-04-28 11:15:54,932 INFO L290 TraceCheckUtils]: 80: Hoare triple {7855#true} ~cond := #in~cond; {8033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:54,932 INFO L290 TraceCheckUtils]: 81: Hoare triple {8033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,933 INFO L290 TraceCheckUtils]: 82: Hoare triple {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,933 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #65#return; {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,933 INFO L272 TraceCheckUtils]: 84: Hoare triple {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7855#true} is VALID [2022-04-28 11:15:54,934 INFO L290 TraceCheckUtils]: 85: Hoare triple {7855#true} ~cond := #in~cond; {8033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:54,934 INFO L290 TraceCheckUtils]: 86: Hoare triple {8033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,935 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8037#(not (= |__VERIFIER_assert_#in~cond| 0))} {8047#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 1) (= 12 (+ main_~y~0 (- 7))) (= main_~x~0 8))} #67#return; {8129#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= main_~n~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,936 INFO L290 TraceCheckUtils]: 89: Hoare triple {8129#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= main_~n~0 2) (= main_~x~0 8))} assume !(~n~0 <= ~a~0); {8133#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,936 INFO L272 TraceCheckUtils]: 90: Hoare triple {8133#(and (not (<= 2 main_~a~0)) (= 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)); {7855#true} is VALID [2022-04-28 11:15:54,936 INFO L290 TraceCheckUtils]: 91: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-28 11:15:54,936 INFO L290 TraceCheckUtils]: 92: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-28 11:15:54,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-28 11:15:54,937 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {7855#true} {8133#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #69#return; {8133#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,938 INFO L272 TraceCheckUtils]: 95: Hoare triple {8133#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 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)); {8152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:54,938 INFO L290 TraceCheckUtils]: 96: Hoare triple {8152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:54,939 INFO L290 TraceCheckUtils]: 97: Hoare triple {8156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7856#false} is VALID [2022-04-28 11:15:54,939 INFO L290 TraceCheckUtils]: 98: Hoare triple {7856#false} assume !false; {7856#false} is VALID [2022-04-28 11:15:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 128 proven. 45 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-04-28 11:15:54,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:17,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731496689] [2022-04-28 11:16:17,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:17,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738308661] [2022-04-28 11:16:17,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738308661] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:16:17,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:16:17,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 11:16:17,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:17,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1829248312] [2022-04-28 11:16:17,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1829248312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:17,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:17,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:16:17,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762755785] [2022-04-28 11:16:17,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:17,885 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:16:17,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:17,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:17,962 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:16:17,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:16:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:16:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:16:17,963 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:19,485 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2022-04-28 11:16:19,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:16:19,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2022-04-28 11:16:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 11:16:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 11:16:19,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-28 11:16:19,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:19,585 INFO L225 Difference]: With dead ends: 110 [2022-04-28 11:16:19,585 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 11:16:19,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:16:19,586 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:19,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:16:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 11:16:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 11:16:19,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:19,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:19,708 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:19,708 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:19,711 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-28 11:16:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-28 11:16:19,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:19,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:19,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 100 states. [2022-04-28 11:16:19,712 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 100 states. [2022-04-28 11:16:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:19,714 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-28 11:16:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-28 11:16:19,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:19,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:19,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:19,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-04-28 11:16:19,717 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 99 [2022-04-28 11:16:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:19,717 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-04-28 11:16:19,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:19,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 111 transitions. [2022-04-28 11:16:21,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 110 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-28 11:16:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 11:16:21,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:21,934 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:16:21,941 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:16:22,139 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,SelfDestructingSolverStorable13 [2022-04-28 11:16:22,139 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 5 times [2022-04-28 11:16:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:22,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [827306778] [2022-04-28 11:16:22,435 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:22,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1894407742, now seen corresponding path program 6 times [2022-04-28 11:16:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:22,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614860536] [2022-04-28 11:16:22,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:22,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:22,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:22,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100967384] [2022-04-28 11:16:22,451 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:16:22,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:22,452 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:16:22,453 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:16:22,683 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:16:22,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:22,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:16:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:22,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:23,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {8911#true} call ULTIMATE.init(); {8911#true} is VALID [2022-04-28 11:16:23,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {8911#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8919#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:23,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {8919#(<= ~counter~0 0)} assume true; {8919#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:23,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8919#(<= ~counter~0 0)} {8911#true} #81#return; {8919#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:23,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {8919#(<= ~counter~0 0)} call #t~ret6 := main(); {8919#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:23,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {8919#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8919#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:23,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {8919#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {8935#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,047 INFO L272 TraceCheckUtils]: 8: Hoare triple {8935#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {8935#(<= ~counter~0 1)} ~cond := #in~cond; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {8935#(<= ~counter~0 1)} assume !(0 == ~cond); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {8935#(<= ~counter~0 1)} assume true; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,048 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8935#(<= ~counter~0 1)} {8935#(<= ~counter~0 1)} #59#return; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,048 INFO L272 TraceCheckUtils]: 13: Hoare triple {8935#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {8935#(<= ~counter~0 1)} ~cond := #in~cond; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {8935#(<= ~counter~0 1)} assume !(0 == ~cond); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {8935#(<= ~counter~0 1)} assume true; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,050 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8935#(<= ~counter~0 1)} {8935#(<= ~counter~0 1)} #61#return; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,050 INFO L272 TraceCheckUtils]: 18: Hoare triple {8935#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {8935#(<= ~counter~0 1)} ~cond := #in~cond; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {8935#(<= ~counter~0 1)} assume !(0 == ~cond); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {8935#(<= ~counter~0 1)} assume true; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,051 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8935#(<= ~counter~0 1)} {8935#(<= ~counter~0 1)} #63#return; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,052 INFO L272 TraceCheckUtils]: 23: Hoare triple {8935#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {8935#(<= ~counter~0 1)} ~cond := #in~cond; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {8935#(<= ~counter~0 1)} assume !(0 == ~cond); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {8935#(<= ~counter~0 1)} assume true; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,053 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8935#(<= ~counter~0 1)} {8935#(<= ~counter~0 1)} #65#return; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,054 INFO L272 TraceCheckUtils]: 28: Hoare triple {8935#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {8935#(<= ~counter~0 1)} ~cond := #in~cond; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {8935#(<= ~counter~0 1)} assume !(0 == ~cond); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {8935#(<= ~counter~0 1)} assume true; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,055 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8935#(<= ~counter~0 1)} {8935#(<= ~counter~0 1)} #67#return; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {8935#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {8935#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {9020#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,056 INFO L272 TraceCheckUtils]: 36: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {9020#(<= ~counter~0 2)} ~cond := #in~cond; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {9020#(<= ~counter~0 2)} assume !(0 == ~cond); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {9020#(<= ~counter~0 2)} assume true; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,058 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9020#(<= ~counter~0 2)} {9020#(<= ~counter~0 2)} #59#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,058 INFO L272 TraceCheckUtils]: 41: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {9020#(<= ~counter~0 2)} ~cond := #in~cond; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {9020#(<= ~counter~0 2)} assume !(0 == ~cond); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {9020#(<= ~counter~0 2)} assume true; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,059 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9020#(<= ~counter~0 2)} {9020#(<= ~counter~0 2)} #61#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,060 INFO L272 TraceCheckUtils]: 46: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {9020#(<= ~counter~0 2)} ~cond := #in~cond; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {9020#(<= ~counter~0 2)} assume !(0 == ~cond); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {9020#(<= ~counter~0 2)} assume true; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,061 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9020#(<= ~counter~0 2)} {9020#(<= ~counter~0 2)} #63#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,061 INFO L272 TraceCheckUtils]: 51: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {9020#(<= ~counter~0 2)} ~cond := #in~cond; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {9020#(<= ~counter~0 2)} assume !(0 == ~cond); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {9020#(<= ~counter~0 2)} assume true; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,063 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9020#(<= ~counter~0 2)} {9020#(<= ~counter~0 2)} #65#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,063 INFO L272 TraceCheckUtils]: 56: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {9020#(<= ~counter~0 2)} ~cond := #in~cond; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {9020#(<= ~counter~0 2)} assume !(0 == ~cond); {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {9020#(<= ~counter~0 2)} assume true; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,064 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9020#(<= ~counter~0 2)} {9020#(<= ~counter~0 2)} #67#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {9020#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {9020#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {9105#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,066 INFO L272 TraceCheckUtils]: 64: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {9105#(<= ~counter~0 3)} ~cond := #in~cond; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {9105#(<= ~counter~0 3)} assume !(0 == ~cond); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {9105#(<= ~counter~0 3)} assume true; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,067 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9105#(<= ~counter~0 3)} {9105#(<= ~counter~0 3)} #59#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,067 INFO L272 TraceCheckUtils]: 69: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,068 INFO L290 TraceCheckUtils]: 70: Hoare triple {9105#(<= ~counter~0 3)} ~cond := #in~cond; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,068 INFO L290 TraceCheckUtils]: 71: Hoare triple {9105#(<= ~counter~0 3)} assume !(0 == ~cond); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,068 INFO L290 TraceCheckUtils]: 72: Hoare triple {9105#(<= ~counter~0 3)} assume true; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,069 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9105#(<= ~counter~0 3)} {9105#(<= ~counter~0 3)} #61#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,069 INFO L272 TraceCheckUtils]: 74: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,070 INFO L290 TraceCheckUtils]: 75: Hoare triple {9105#(<= ~counter~0 3)} ~cond := #in~cond; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,070 INFO L290 TraceCheckUtils]: 76: Hoare triple {9105#(<= ~counter~0 3)} assume !(0 == ~cond); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {9105#(<= ~counter~0 3)} assume true; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,071 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9105#(<= ~counter~0 3)} {9105#(<= ~counter~0 3)} #63#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,071 INFO L272 TraceCheckUtils]: 79: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,072 INFO L290 TraceCheckUtils]: 80: Hoare triple {9105#(<= ~counter~0 3)} ~cond := #in~cond; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,072 INFO L290 TraceCheckUtils]: 81: Hoare triple {9105#(<= ~counter~0 3)} assume !(0 == ~cond); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,072 INFO L290 TraceCheckUtils]: 82: Hoare triple {9105#(<= ~counter~0 3)} assume true; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,073 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9105#(<= ~counter~0 3)} {9105#(<= ~counter~0 3)} #65#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,073 INFO L272 TraceCheckUtils]: 84: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,073 INFO L290 TraceCheckUtils]: 85: Hoare triple {9105#(<= ~counter~0 3)} ~cond := #in~cond; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,074 INFO L290 TraceCheckUtils]: 86: Hoare triple {9105#(<= ~counter~0 3)} assume !(0 == ~cond); {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,074 INFO L290 TraceCheckUtils]: 87: Hoare triple {9105#(<= ~counter~0 3)} assume true; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,074 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9105#(<= ~counter~0 3)} {9105#(<= ~counter~0 3)} #67#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,075 INFO L290 TraceCheckUtils]: 89: Hoare triple {9105#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,075 INFO L290 TraceCheckUtils]: 90: Hoare triple {9105#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9190#(<= |main_#t~post5| 3)} is VALID [2022-04-28 11:16:23,075 INFO L290 TraceCheckUtils]: 91: Hoare triple {9190#(<= |main_#t~post5| 3)} assume !(#t~post5 < 5);havoc #t~post5; {8912#false} is VALID [2022-04-28 11:16:23,075 INFO L272 TraceCheckUtils]: 92: Hoare triple {8912#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L290 TraceCheckUtils]: 93: Hoare triple {8912#false} ~cond := #in~cond; {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L290 TraceCheckUtils]: 94: Hoare triple {8912#false} assume !(0 == ~cond); {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L290 TraceCheckUtils]: 95: Hoare triple {8912#false} assume true; {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8912#false} {8912#false} #69#return; {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L272 TraceCheckUtils]: 97: Hoare triple {8912#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L290 TraceCheckUtils]: 98: Hoare triple {8912#false} ~cond := #in~cond; {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L290 TraceCheckUtils]: 99: Hoare triple {8912#false} assume 0 == ~cond; {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L290 TraceCheckUtils]: 100: Hoare triple {8912#false} assume !false; {8912#false} is VALID [2022-04-28 11:16:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 90 proven. 330 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-28 11:16:23,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:23,429 INFO L290 TraceCheckUtils]: 100: Hoare triple {8912#false} assume !false; {8912#false} is VALID [2022-04-28 11:16:23,430 INFO L290 TraceCheckUtils]: 99: Hoare triple {8912#false} assume 0 == ~cond; {8912#false} is VALID [2022-04-28 11:16:23,430 INFO L290 TraceCheckUtils]: 98: Hoare triple {8912#false} ~cond := #in~cond; {8912#false} is VALID [2022-04-28 11:16:23,430 INFO L272 TraceCheckUtils]: 97: Hoare triple {8912#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8912#false} is VALID [2022-04-28 11:16:23,430 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8911#true} {8912#false} #69#return; {8912#false} is VALID [2022-04-28 11:16:23,430 INFO L290 TraceCheckUtils]: 95: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,430 INFO L290 TraceCheckUtils]: 93: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,430 INFO L272 TraceCheckUtils]: 92: Hoare triple {8912#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,430 INFO L290 TraceCheckUtils]: 91: Hoare triple {9248#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {8912#false} is VALID [2022-04-28 11:16:23,431 INFO L290 TraceCheckUtils]: 90: Hoare triple {9252#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9248#(< |main_#t~post5| 5)} is VALID [2022-04-28 11:16:23,431 INFO L290 TraceCheckUtils]: 89: Hoare triple {9252#(< ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,432 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8911#true} {9252#(< ~counter~0 5)} #67#return; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,432 INFO L290 TraceCheckUtils]: 87: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,432 INFO L290 TraceCheckUtils]: 86: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,432 INFO L290 TraceCheckUtils]: 85: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,432 INFO L272 TraceCheckUtils]: 84: Hoare triple {9252#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,432 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8911#true} {9252#(< ~counter~0 5)} #65#return; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,433 INFO L272 TraceCheckUtils]: 79: Hoare triple {9252#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,433 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8911#true} {9252#(< ~counter~0 5)} #63#return; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,433 INFO L290 TraceCheckUtils]: 77: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,433 INFO L290 TraceCheckUtils]: 75: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,434 INFO L272 TraceCheckUtils]: 74: Hoare triple {9252#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,434 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8911#true} {9252#(< ~counter~0 5)} #61#return; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,434 INFO L290 TraceCheckUtils]: 72: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,434 INFO L272 TraceCheckUtils]: 69: Hoare triple {9252#(< ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,435 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8911#true} {9252#(< ~counter~0 5)} #59#return; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,435 INFO L290 TraceCheckUtils]: 67: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,435 INFO L272 TraceCheckUtils]: 64: Hoare triple {9252#(< ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {9252#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {9105#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9252#(< ~counter~0 5)} is VALID [2022-04-28 11:16:23,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {9105#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,440 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8911#true} {9105#(<= ~counter~0 3)} #67#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,440 INFO L272 TraceCheckUtils]: 56: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,441 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8911#true} {9105#(<= ~counter~0 3)} #65#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,441 INFO L272 TraceCheckUtils]: 51: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,442 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8911#true} {9105#(<= ~counter~0 3)} #63#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,442 INFO L272 TraceCheckUtils]: 46: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,443 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8911#true} {9105#(<= ~counter~0 3)} #61#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,443 INFO L272 TraceCheckUtils]: 41: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,444 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8911#true} {9105#(<= ~counter~0 3)} #59#return; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,444 INFO L272 TraceCheckUtils]: 36: Hoare triple {9105#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {9105#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {9020#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9105#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:23,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {9020#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,472 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8911#true} {9020#(<= ~counter~0 2)} #67#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,472 INFO L272 TraceCheckUtils]: 28: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,473 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8911#true} {9020#(<= ~counter~0 2)} #65#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,473 INFO L272 TraceCheckUtils]: 23: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,473 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8911#true} {9020#(<= ~counter~0 2)} #63#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,474 INFO L272 TraceCheckUtils]: 18: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,474 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8911#true} {9020#(<= ~counter~0 2)} #61#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,475 INFO L272 TraceCheckUtils]: 13: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,475 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8911#true} {9020#(<= ~counter~0 2)} #59#return; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {8911#true} assume true; {8911#true} is VALID [2022-04-28 11:16:23,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {8911#true} assume !(0 == ~cond); {8911#true} is VALID [2022-04-28 11:16:23,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {8911#true} ~cond := #in~cond; {8911#true} is VALID [2022-04-28 11:16:23,476 INFO L272 TraceCheckUtils]: 8: Hoare triple {9020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8911#true} is VALID [2022-04-28 11:16:23,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {9020#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {8935#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9020#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:23,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {8935#(<= ~counter~0 1)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {8935#(<= ~counter~0 1)} call #t~ret6 := main(); {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8935#(<= ~counter~0 1)} {8911#true} #81#return; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {8935#(<= ~counter~0 1)} assume true; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {8911#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8935#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:23,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {8911#true} call ULTIMATE.init(); {8911#true} is VALID [2022-04-28 11:16:23,479 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:16:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:23,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614860536] [2022-04-28 11:16:23,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:23,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100967384] [2022-04-28 11:16:23,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100967384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:23,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:23,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:16:23,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [827306778] [2022-04-28 11:16:23,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [827306778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:23,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:23,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:16:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810879326] [2022-04-28 11:16:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:16:23,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:23,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:23,531 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:16:23,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:16:23,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:23,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:16:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:16:23,532 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:24,206 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-04-28 11:16:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:16:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 101 [2022-04-28 11:16:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 11:16:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 11:16:24,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-28 11:16:24,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:24,285 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:16:24,285 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 11:16:24,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:16:24,286 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:24,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 146 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:16:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 11:16:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 11:16:24,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:24,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:24,424 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:24,425 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:24,426 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-28 11:16:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-28 11:16:24,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:24,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:24,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 102 states. [2022-04-28 11:16:24,427 INFO L87 Difference]: Start difference. First operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 102 states. [2022-04-28 11:16:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:24,429 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-28 11:16:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-28 11:16:24,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:24,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:24,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:24,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:16:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2022-04-28 11:16:24,432 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 101 [2022-04-28 11:16:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:24,432 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2022-04-28 11:16:24,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 6 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 11:16:24,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 113 transitions. [2022-04-28 11:16:26,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 112 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-28 11:16:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 11:16:26,589 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:26,589 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:16:26,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 11:16:26,795 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,SelfDestructingSolverStorable14 [2022-04-28 11:16:26,795 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:26,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 5 times [2022-04-28 11:16:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:26,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726694316] [2022-04-28 11:16:27,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:27,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 6 times [2022-04-28 11:16:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:27,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85321652] [2022-04-28 11:16:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:27,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:27,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1107949795] [2022-04-28 11:16:27,029 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:16:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:27,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:27,030 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:16:27,064 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:16:27,526 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:16:27,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:27,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 11:16:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:27,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:28,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {10171#true} call ULTIMATE.init(); {10171#true} is VALID [2022-04-28 11:16:28,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {10171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10171#true} is VALID [2022-04-28 11:16:28,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10171#true} {10171#true} #81#return; {10171#true} is VALID [2022-04-28 11:16:28,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {10171#true} call #t~ret6 := main(); {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {10171#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {10171#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {10171#true} assume !!(#t~post5 < 5);havoc #t~post5; {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L272 TraceCheckUtils]: 8: Hoare triple {10171#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10171#true} {10171#true} #59#return; {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L272 TraceCheckUtils]: 13: Hoare triple {10171#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10171#true} {10171#true} #61#return; {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L272 TraceCheckUtils]: 18: Hoare triple {10171#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10171#true} {10171#true} #63#return; {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L272 TraceCheckUtils]: 23: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,280 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10171#true} {10171#true} #65#return; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L272 TraceCheckUtils]: 28: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10171#true} {10171#true} #67#return; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {10171#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; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {10171#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {10171#true} assume !!(#t~post5 < 5);havoc #t~post5; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L272 TraceCheckUtils]: 36: Hoare triple {10171#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10171#true} {10171#true} #59#return; {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L272 TraceCheckUtils]: 41: Hoare triple {10171#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10171#true} {10171#true} #61#return; {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L272 TraceCheckUtils]: 46: Hoare triple {10171#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10171#true} {10171#true} #63#return; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L272 TraceCheckUtils]: 51: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10171#true} {10171#true} #65#return; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L272 TraceCheckUtils]: 56: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10171#true} {10171#true} #67#return; {10171#true} is VALID [2022-04-28 11:16:28,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {10171#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; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {10171#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {10171#true} assume !!(#t~post5 < 5);havoc #t~post5; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L272 TraceCheckUtils]: 64: Hoare triple {10171#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 65: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10171#true} {10171#true} #59#return; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L272 TraceCheckUtils]: 69: Hoare triple {10171#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L290 TraceCheckUtils]: 72: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,284 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10171#true} {10171#true} #61#return; {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L272 TraceCheckUtils]: 74: Hoare triple {10171#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L290 TraceCheckUtils]: 77: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10171#true} {10171#true} #63#return; {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L272 TraceCheckUtils]: 79: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L290 TraceCheckUtils]: 80: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L290 TraceCheckUtils]: 81: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L290 TraceCheckUtils]: 82: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10171#true} {10171#true} #65#return; {10171#true} is VALID [2022-04-28 11:16:28,285 INFO L272 TraceCheckUtils]: 84: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,286 INFO L290 TraceCheckUtils]: 85: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,286 INFO L290 TraceCheckUtils]: 86: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,286 INFO L290 TraceCheckUtils]: 87: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,286 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10171#true} {10171#true} #67#return; {10171#true} is VALID [2022-04-28 11:16:28,287 INFO L290 TraceCheckUtils]: 89: Hoare triple {10171#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; {10443#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-28 11:16:28,287 INFO L290 TraceCheckUtils]: 90: Hoare triple {10443#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10443#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-28 11:16:28,287 INFO L290 TraceCheckUtils]: 91: Hoare triple {10443#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {10443#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-28 11:16:28,287 INFO L272 TraceCheckUtils]: 92: Hoare triple {10443#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,288 INFO L290 TraceCheckUtils]: 93: Hoare triple {10171#true} ~cond := #in~cond; {10456#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:28,288 INFO L290 TraceCheckUtils]: 94: Hoare triple {10456#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:28,288 INFO L290 TraceCheckUtils]: 95: Hoare triple {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:28,289 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} {10443#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:16:28,289 INFO L272 TraceCheckUtils]: 97: Hoare triple {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,289 INFO L290 TraceCheckUtils]: 98: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,289 INFO L290 TraceCheckUtils]: 99: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,290 INFO L290 TraceCheckUtils]: 100: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,290 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10171#true} {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:16:28,290 INFO L272 TraceCheckUtils]: 102: Hoare triple {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,290 INFO L290 TraceCheckUtils]: 103: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,290 INFO L290 TraceCheckUtils]: 104: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,290 INFO L290 TraceCheckUtils]: 105: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,291 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10171#true} {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:16:28,291 INFO L272 TraceCheckUtils]: 107: Hoare triple {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,291 INFO L290 TraceCheckUtils]: 108: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,291 INFO L290 TraceCheckUtils]: 109: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,291 INFO L290 TraceCheckUtils]: 110: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,292 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10171#true} {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:16:28,292 INFO L272 TraceCheckUtils]: 112: Hoare triple {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,292 INFO L290 TraceCheckUtils]: 113: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,292 INFO L290 TraceCheckUtils]: 114: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,292 INFO L290 TraceCheckUtils]: 115: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,293 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10171#true} {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:16:28,294 INFO L290 TraceCheckUtils]: 117: Hoare triple {10467#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:16:28,294 INFO L272 TraceCheckUtils]: 118: Hoare triple {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:28,294 INFO L290 TraceCheckUtils]: 119: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:28,294 INFO L290 TraceCheckUtils]: 120: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:28,294 INFO L290 TraceCheckUtils]: 121: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:28,295 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10171#true} {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:16:30,297 WARN L272 TraceCheckUtils]: 123: Hoare triple {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10550#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 11:16:30,297 INFO L290 TraceCheckUtils]: 124: Hoare triple {10550#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:30,297 INFO L290 TraceCheckUtils]: 125: Hoare triple {10554#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10172#false} is VALID [2022-04-28 11:16:30,298 INFO L290 TraceCheckUtils]: 126: Hoare triple {10172#false} assume !false; {10172#false} is VALID [2022-04-28 11:16:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-04-28 11:16:30,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:31,251 INFO L290 TraceCheckUtils]: 126: Hoare triple {10172#false} assume !false; {10172#false} is VALID [2022-04-28 11:16:31,252 INFO L290 TraceCheckUtils]: 125: Hoare triple {10554#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10172#false} is VALID [2022-04-28 11:16:31,252 INFO L290 TraceCheckUtils]: 124: Hoare triple {10550#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:33,254 WARN L272 TraceCheckUtils]: 123: Hoare triple {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10550#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-28 11:16:33,255 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {10171#true} {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:16:33,255 INFO L290 TraceCheckUtils]: 121: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,255 INFO L290 TraceCheckUtils]: 120: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,255 INFO L290 TraceCheckUtils]: 119: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,255 INFO L272 TraceCheckUtils]: 118: Hoare triple {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,256 INFO L290 TraceCheckUtils]: 117: Hoare triple {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {10531#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:16:33,256 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10171#true} {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #67#return; {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:16:33,257 INFO L290 TraceCheckUtils]: 115: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,257 INFO L290 TraceCheckUtils]: 114: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,257 INFO L290 TraceCheckUtils]: 113: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,257 INFO L272 TraceCheckUtils]: 112: Hoare triple {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= 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)); {10171#true} is VALID [2022-04-28 11:16:33,257 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10171#true} {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #65#return; {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:16:33,257 INFO L290 TraceCheckUtils]: 110: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,257 INFO L290 TraceCheckUtils]: 109: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,257 INFO L290 TraceCheckUtils]: 108: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,258 INFO L272 TraceCheckUtils]: 107: Hoare triple {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= 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)); {10171#true} is VALID [2022-04-28 11:16:33,258 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10171#true} {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #63#return; {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:16:33,258 INFO L290 TraceCheckUtils]: 105: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,258 INFO L290 TraceCheckUtils]: 104: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,258 INFO L290 TraceCheckUtils]: 103: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,258 INFO L272 TraceCheckUtils]: 102: Hoare triple {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,259 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10171#true} {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #61#return; {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:16:33,259 INFO L290 TraceCheckUtils]: 100: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,259 INFO L290 TraceCheckUtils]: 99: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,259 INFO L290 TraceCheckUtils]: 98: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,259 INFO L272 TraceCheckUtils]: 97: Hoare triple {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= 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)); {10171#true} is VALID [2022-04-28 11:16:33,261 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} {10652#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #59#return; {10588#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-28 11:16:33,261 INFO L290 TraceCheckUtils]: 95: Hoare triple {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:33,262 INFO L290 TraceCheckUtils]: 94: Hoare triple {10662#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10460#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:33,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {10171#true} ~cond := #in~cond; {10662#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:33,262 INFO L272 TraceCheckUtils]: 92: Hoare triple {10652#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,262 INFO L290 TraceCheckUtils]: 91: Hoare triple {10652#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {10652#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-28 11:16:33,263 INFO L290 TraceCheckUtils]: 90: Hoare triple {10652#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10652#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-28 11:16:33,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {10171#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; {10652#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-28 11:16:33,264 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10171#true} {10171#true} #67#return; {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L272 TraceCheckUtils]: 84: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10171#true} {10171#true} #65#return; {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L290 TraceCheckUtils]: 82: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L290 TraceCheckUtils]: 81: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L290 TraceCheckUtils]: 80: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L272 TraceCheckUtils]: 79: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,264 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10171#true} {10171#true} #63#return; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L272 TraceCheckUtils]: 74: Hoare triple {10171#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10171#true} {10171#true} #61#return; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 72: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 71: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 70: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L272 TraceCheckUtils]: 69: Hoare triple {10171#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10171#true} {10171#true} #59#return; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 67: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 66: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L272 TraceCheckUtils]: 64: Hoare triple {10171#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {10171#true} assume !!(#t~post5 < 5);havoc #t~post5; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L290 TraceCheckUtils]: 62: Hoare triple {10171#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {10171#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; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10171#true} {10171#true} #67#return; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L290 TraceCheckUtils]: 59: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L272 TraceCheckUtils]: 56: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10171#true} {10171#true} #65#return; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L272 TraceCheckUtils]: 51: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10171#true} {10171#true} #63#return; {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L272 TraceCheckUtils]: 46: Hoare triple {10171#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10171#true} {10171#true} #61#return; {10171#true} is VALID [2022-04-28 11:16:33,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L272 TraceCheckUtils]: 41: Hoare triple {10171#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10171#true} {10171#true} #59#return; {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L272 TraceCheckUtils]: 36: Hoare triple {10171#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {10171#true} assume !!(#t~post5 < 5);havoc #t~post5; {10171#true} is VALID [2022-04-28 11:16:33,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {10171#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {10171#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; {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10171#true} {10171#true} #67#return; {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L272 TraceCheckUtils]: 28: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10171#true} {10171#true} #65#return; {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L272 TraceCheckUtils]: 23: Hoare triple {10171#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10171#true} {10171#true} #63#return; {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L272 TraceCheckUtils]: 18: Hoare triple {10171#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10171#true} {10171#true} #61#return; {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L272 TraceCheckUtils]: 13: Hoare triple {10171#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10171#true} {10171#true} #59#return; {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {10171#true} assume !(0 == ~cond); {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {10171#true} ~cond := #in~cond; {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L272 TraceCheckUtils]: 8: Hoare triple {10171#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {10171#true} assume !!(#t~post5 < 5);havoc #t~post5; {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {10171#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {10171#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10171#true} is VALID [2022-04-28 11:16:33,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {10171#true} call #t~ret6 := main(); {10171#true} is VALID [2022-04-28 11:16:33,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10171#true} {10171#true} #81#return; {10171#true} is VALID [2022-04-28 11:16:33,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {10171#true} assume true; {10171#true} is VALID [2022-04-28 11:16:33,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {10171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10171#true} is VALID [2022-04-28 11:16:33,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {10171#true} call ULTIMATE.init(); {10171#true} is VALID [2022-04-28 11:16:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-04-28 11:16:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85321652] [2022-04-28 11:16:33,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107949795] [2022-04-28 11:16:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107949795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:33,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:33,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-28 11:16:33,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726694316] [2022-04-28 11:16:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726694316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:16:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848068660] [2022-04-28 11:16:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:33,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 127 [2022-04-28 11:16:33,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:33,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:16:34,297 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:16:34,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:16:34,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:34,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:16:34,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:16:34,298 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:16:39,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:41,906 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:16:47,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:16:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:48,337 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-04-28 11:16:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:16:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 127 [2022-04-28 11:16:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:16:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 11:16:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:16:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 11:16:48,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-28 11:16:50,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:50,404 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:16:50,404 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:16:50,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:16:50,405 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:50,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 146 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 258 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 11:16:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:16:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2022-04-28 11:16:50,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:50,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:16:50,538 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:16:50,538 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:16:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:50,540 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-28 11:16:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-28 11:16:50,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:50,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:50,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 110 states. [2022-04-28 11:16:50,541 INFO L87 Difference]: Start difference. First operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 110 states. [2022-04-28 11:16:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:50,557 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-28 11:16:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-28 11:16:50,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:50,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:50,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:50,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:16:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-04-28 11:16:50,562 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 127 [2022-04-28 11:16:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:50,563 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-04-28 11:16:50,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:16:50,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 120 transitions. [2022-04-28 11:16:52,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-04-28 11:16:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:16:52,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:52,916 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:16:52,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 11:16:53,116 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,SelfDestructingSolverStorable15 [2022-04-28 11:16:53,116 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 7 times [2022-04-28 11:16:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:53,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120038887] [2022-04-28 11:16:53,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:53,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 8 times [2022-04-28 11:16:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:53,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404301564] [2022-04-28 11:16:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:53,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:53,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925453128] [2022-04-28 11:16:53,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:16:53,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:53,359 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:16:53,389 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:16:53,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:16:53,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:53,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:16:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:53,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:53,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {11610#true} call ULTIMATE.init(); {11610#true} is VALID [2022-04-28 11:16:53,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {11610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:53,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {11618#(<= ~counter~0 0)} assume true; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:53,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11618#(<= ~counter~0 0)} {11610#true} #81#return; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:53,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {11618#(<= ~counter~0 0)} call #t~ret6 := main(); {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:53,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {11618#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:53,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {11618#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {11634#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,908 INFO L272 TraceCheckUtils]: 8: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {11634#(<= ~counter~0 1)} ~cond := #in~cond; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {11634#(<= ~counter~0 1)} assume !(0 == ~cond); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {11634#(<= ~counter~0 1)} assume true; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,909 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11634#(<= ~counter~0 1)} {11634#(<= ~counter~0 1)} #59#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,910 INFO L272 TraceCheckUtils]: 13: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {11634#(<= ~counter~0 1)} ~cond := #in~cond; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {11634#(<= ~counter~0 1)} assume !(0 == ~cond); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {11634#(<= ~counter~0 1)} assume true; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,911 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11634#(<= ~counter~0 1)} {11634#(<= ~counter~0 1)} #61#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,911 INFO L272 TraceCheckUtils]: 18: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {11634#(<= ~counter~0 1)} ~cond := #in~cond; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {11634#(<= ~counter~0 1)} assume !(0 == ~cond); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {11634#(<= ~counter~0 1)} assume true; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,912 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11634#(<= ~counter~0 1)} {11634#(<= ~counter~0 1)} #63#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,913 INFO L272 TraceCheckUtils]: 23: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {11634#(<= ~counter~0 1)} ~cond := #in~cond; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {11634#(<= ~counter~0 1)} assume !(0 == ~cond); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {11634#(<= ~counter~0 1)} assume true; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,914 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11634#(<= ~counter~0 1)} {11634#(<= ~counter~0 1)} #65#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,915 INFO L272 TraceCheckUtils]: 28: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {11634#(<= ~counter~0 1)} ~cond := #in~cond; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {11634#(<= ~counter~0 1)} assume !(0 == ~cond); {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {11634#(<= ~counter~0 1)} assume true; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,916 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11634#(<= ~counter~0 1)} {11634#(<= ~counter~0 1)} #67#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {11634#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:53,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {11634#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {11719#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,917 INFO L272 TraceCheckUtils]: 36: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {11719#(<= ~counter~0 2)} ~cond := #in~cond; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {11719#(<= ~counter~0 2)} assume !(0 == ~cond); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {11719#(<= ~counter~0 2)} assume true; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,918 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11719#(<= ~counter~0 2)} {11719#(<= ~counter~0 2)} #59#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,919 INFO L272 TraceCheckUtils]: 41: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {11719#(<= ~counter~0 2)} ~cond := #in~cond; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {11719#(<= ~counter~0 2)} assume !(0 == ~cond); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {11719#(<= ~counter~0 2)} assume true; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,920 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11719#(<= ~counter~0 2)} {11719#(<= ~counter~0 2)} #61#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,921 INFO L272 TraceCheckUtils]: 46: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {11719#(<= ~counter~0 2)} ~cond := #in~cond; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {11719#(<= ~counter~0 2)} assume !(0 == ~cond); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {11719#(<= ~counter~0 2)} assume true; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,922 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11719#(<= ~counter~0 2)} {11719#(<= ~counter~0 2)} #63#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,922 INFO L272 TraceCheckUtils]: 51: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {11719#(<= ~counter~0 2)} ~cond := #in~cond; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {11719#(<= ~counter~0 2)} assume !(0 == ~cond); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {11719#(<= ~counter~0 2)} assume true; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,924 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11719#(<= ~counter~0 2)} {11719#(<= ~counter~0 2)} #65#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,924 INFO L272 TraceCheckUtils]: 56: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {11719#(<= ~counter~0 2)} ~cond := #in~cond; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {11719#(<= ~counter~0 2)} assume !(0 == ~cond); {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,925 INFO L290 TraceCheckUtils]: 59: Hoare triple {11719#(<= ~counter~0 2)} assume true; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,925 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11719#(<= ~counter~0 2)} {11719#(<= ~counter~0 2)} #67#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {11719#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:53,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {11719#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {11804#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,927 INFO L272 TraceCheckUtils]: 64: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {11804#(<= ~counter~0 3)} ~cond := #in~cond; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {11804#(<= ~counter~0 3)} assume !(0 == ~cond); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,927 INFO L290 TraceCheckUtils]: 67: Hoare triple {11804#(<= ~counter~0 3)} assume true; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,928 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11804#(<= ~counter~0 3)} {11804#(<= ~counter~0 3)} #59#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,928 INFO L272 TraceCheckUtils]: 69: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,929 INFO L290 TraceCheckUtils]: 70: Hoare triple {11804#(<= ~counter~0 3)} ~cond := #in~cond; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,929 INFO L290 TraceCheckUtils]: 71: Hoare triple {11804#(<= ~counter~0 3)} assume !(0 == ~cond); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,929 INFO L290 TraceCheckUtils]: 72: Hoare triple {11804#(<= ~counter~0 3)} assume true; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,930 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11804#(<= ~counter~0 3)} {11804#(<= ~counter~0 3)} #61#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,930 INFO L272 TraceCheckUtils]: 74: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,930 INFO L290 TraceCheckUtils]: 75: Hoare triple {11804#(<= ~counter~0 3)} ~cond := #in~cond; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,930 INFO L290 TraceCheckUtils]: 76: Hoare triple {11804#(<= ~counter~0 3)} assume !(0 == ~cond); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,931 INFO L290 TraceCheckUtils]: 77: Hoare triple {11804#(<= ~counter~0 3)} assume true; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,931 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11804#(<= ~counter~0 3)} {11804#(<= ~counter~0 3)} #63#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,932 INFO L272 TraceCheckUtils]: 79: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,932 INFO L290 TraceCheckUtils]: 80: Hoare triple {11804#(<= ~counter~0 3)} ~cond := #in~cond; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,932 INFO L290 TraceCheckUtils]: 81: Hoare triple {11804#(<= ~counter~0 3)} assume !(0 == ~cond); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,932 INFO L290 TraceCheckUtils]: 82: Hoare triple {11804#(<= ~counter~0 3)} assume true; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,933 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11804#(<= ~counter~0 3)} {11804#(<= ~counter~0 3)} #65#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,933 INFO L272 TraceCheckUtils]: 84: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,934 INFO L290 TraceCheckUtils]: 85: Hoare triple {11804#(<= ~counter~0 3)} ~cond := #in~cond; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,934 INFO L290 TraceCheckUtils]: 86: Hoare triple {11804#(<= ~counter~0 3)} assume !(0 == ~cond); {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,934 INFO L290 TraceCheckUtils]: 87: Hoare triple {11804#(<= ~counter~0 3)} assume true; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,935 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11804#(<= ~counter~0 3)} {11804#(<= ~counter~0 3)} #67#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,935 INFO L290 TraceCheckUtils]: 89: Hoare triple {11804#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:53,935 INFO L290 TraceCheckUtils]: 90: Hoare triple {11804#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,936 INFO L290 TraceCheckUtils]: 91: Hoare triple {11889#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,936 INFO L272 TraceCheckUtils]: 92: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {11889#(<= ~counter~0 4)} ~cond := #in~cond; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,937 INFO L290 TraceCheckUtils]: 94: Hoare triple {11889#(<= ~counter~0 4)} assume !(0 == ~cond); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,937 INFO L290 TraceCheckUtils]: 95: Hoare triple {11889#(<= ~counter~0 4)} assume true; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,937 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11889#(<= ~counter~0 4)} {11889#(<= ~counter~0 4)} #59#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,938 INFO L272 TraceCheckUtils]: 97: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,938 INFO L290 TraceCheckUtils]: 98: Hoare triple {11889#(<= ~counter~0 4)} ~cond := #in~cond; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,938 INFO L290 TraceCheckUtils]: 99: Hoare triple {11889#(<= ~counter~0 4)} assume !(0 == ~cond); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,938 INFO L290 TraceCheckUtils]: 100: Hoare triple {11889#(<= ~counter~0 4)} assume true; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,939 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11889#(<= ~counter~0 4)} {11889#(<= ~counter~0 4)} #61#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,939 INFO L272 TraceCheckUtils]: 102: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,940 INFO L290 TraceCheckUtils]: 103: Hoare triple {11889#(<= ~counter~0 4)} ~cond := #in~cond; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,940 INFO L290 TraceCheckUtils]: 104: Hoare triple {11889#(<= ~counter~0 4)} assume !(0 == ~cond); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,940 INFO L290 TraceCheckUtils]: 105: Hoare triple {11889#(<= ~counter~0 4)} assume true; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,941 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11889#(<= ~counter~0 4)} {11889#(<= ~counter~0 4)} #63#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,941 INFO L272 TraceCheckUtils]: 107: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,941 INFO L290 TraceCheckUtils]: 108: Hoare triple {11889#(<= ~counter~0 4)} ~cond := #in~cond; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,942 INFO L290 TraceCheckUtils]: 109: Hoare triple {11889#(<= ~counter~0 4)} assume !(0 == ~cond); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,942 INFO L290 TraceCheckUtils]: 110: Hoare triple {11889#(<= ~counter~0 4)} assume true; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,942 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11889#(<= ~counter~0 4)} {11889#(<= ~counter~0 4)} #65#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,943 INFO L272 TraceCheckUtils]: 112: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,943 INFO L290 TraceCheckUtils]: 113: Hoare triple {11889#(<= ~counter~0 4)} ~cond := #in~cond; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,943 INFO L290 TraceCheckUtils]: 114: Hoare triple {11889#(<= ~counter~0 4)} assume !(0 == ~cond); {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,943 INFO L290 TraceCheckUtils]: 115: Hoare triple {11889#(<= ~counter~0 4)} assume true; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,944 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11889#(<= ~counter~0 4)} {11889#(<= ~counter~0 4)} #67#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,944 INFO L290 TraceCheckUtils]: 117: Hoare triple {11889#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:53,944 INFO L290 TraceCheckUtils]: 118: Hoare triple {11889#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11974#(<= |main_#t~post5| 4)} is VALID [2022-04-28 11:16:53,945 INFO L290 TraceCheckUtils]: 119: Hoare triple {11974#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {11611#false} is VALID [2022-04-28 11:16:53,945 INFO L272 TraceCheckUtils]: 120: Hoare triple {11611#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11611#false} is VALID [2022-04-28 11:16:53,945 INFO L290 TraceCheckUtils]: 121: Hoare triple {11611#false} ~cond := #in~cond; {11611#false} is VALID [2022-04-28 11:16:53,945 INFO L290 TraceCheckUtils]: 122: Hoare triple {11611#false} assume !(0 == ~cond); {11611#false} is VALID [2022-04-28 11:16:53,945 INFO L290 TraceCheckUtils]: 123: Hoare triple {11611#false} assume true; {11611#false} is VALID [2022-04-28 11:16:53,945 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {11611#false} {11611#false} #69#return; {11611#false} is VALID [2022-04-28 11:16:53,945 INFO L272 TraceCheckUtils]: 125: Hoare triple {11611#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {11611#false} is VALID [2022-04-28 11:16:53,945 INFO L290 TraceCheckUtils]: 126: Hoare triple {11611#false} ~cond := #in~cond; {11611#false} is VALID [2022-04-28 11:16:53,946 INFO L290 TraceCheckUtils]: 127: Hoare triple {11611#false} assume 0 == ~cond; {11611#false} is VALID [2022-04-28 11:16:53,946 INFO L290 TraceCheckUtils]: 128: Hoare triple {11611#false} assume !false; {11611#false} is VALID [2022-04-28 11:16:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-28 11:16:53,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:54,341 INFO L290 TraceCheckUtils]: 128: Hoare triple {11611#false} assume !false; {11611#false} is VALID [2022-04-28 11:16:54,341 INFO L290 TraceCheckUtils]: 127: Hoare triple {11611#false} assume 0 == ~cond; {11611#false} is VALID [2022-04-28 11:16:54,341 INFO L290 TraceCheckUtils]: 126: Hoare triple {11611#false} ~cond := #in~cond; {11611#false} is VALID [2022-04-28 11:16:54,341 INFO L272 TraceCheckUtils]: 125: Hoare triple {11611#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {11611#false} is VALID [2022-04-28 11:16:54,341 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {11610#true} {11611#false} #69#return; {11611#false} is VALID [2022-04-28 11:16:54,341 INFO L290 TraceCheckUtils]: 123: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,341 INFO L290 TraceCheckUtils]: 122: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,342 INFO L290 TraceCheckUtils]: 121: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,342 INFO L272 TraceCheckUtils]: 120: Hoare triple {11611#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,342 INFO L290 TraceCheckUtils]: 119: Hoare triple {11974#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {11611#false} is VALID [2022-04-28 11:16:54,342 INFO L290 TraceCheckUtils]: 118: Hoare triple {11889#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11974#(<= |main_#t~post5| 4)} is VALID [2022-04-28 11:16:54,343 INFO L290 TraceCheckUtils]: 117: Hoare triple {11889#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,343 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11610#true} {11889#(<= ~counter~0 4)} #67#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,343 INFO L290 TraceCheckUtils]: 115: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,343 INFO L290 TraceCheckUtils]: 114: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,343 INFO L290 TraceCheckUtils]: 113: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,343 INFO L272 TraceCheckUtils]: 112: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,344 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11610#true} {11889#(<= ~counter~0 4)} #65#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,344 INFO L290 TraceCheckUtils]: 110: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,344 INFO L290 TraceCheckUtils]: 109: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,344 INFO L290 TraceCheckUtils]: 108: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,344 INFO L272 TraceCheckUtils]: 107: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,345 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11610#true} {11889#(<= ~counter~0 4)} #63#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,345 INFO L290 TraceCheckUtils]: 105: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,345 INFO L290 TraceCheckUtils]: 104: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,345 INFO L290 TraceCheckUtils]: 103: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,345 INFO L272 TraceCheckUtils]: 102: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,346 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11610#true} {11889#(<= ~counter~0 4)} #61#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,346 INFO L290 TraceCheckUtils]: 100: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,346 INFO L290 TraceCheckUtils]: 99: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,346 INFO L290 TraceCheckUtils]: 98: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,346 INFO L272 TraceCheckUtils]: 97: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,346 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11610#true} {11889#(<= ~counter~0 4)} #59#return; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,346 INFO L290 TraceCheckUtils]: 95: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,346 INFO L290 TraceCheckUtils]: 94: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,347 INFO L290 TraceCheckUtils]: 93: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,347 INFO L272 TraceCheckUtils]: 92: Hoare triple {11889#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,347 INFO L290 TraceCheckUtils]: 91: Hoare triple {11889#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,347 INFO L290 TraceCheckUtils]: 90: Hoare triple {11804#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 11:16:54,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {11804#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,348 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11610#true} {11804#(<= ~counter~0 3)} #67#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,348 INFO L290 TraceCheckUtils]: 87: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,348 INFO L290 TraceCheckUtils]: 86: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,348 INFO L272 TraceCheckUtils]: 84: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,349 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11610#true} {11804#(<= ~counter~0 3)} #65#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,349 INFO L290 TraceCheckUtils]: 82: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,349 INFO L290 TraceCheckUtils]: 81: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,349 INFO L290 TraceCheckUtils]: 80: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,349 INFO L272 TraceCheckUtils]: 79: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,350 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11610#true} {11804#(<= ~counter~0 3)} #63#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,350 INFO L290 TraceCheckUtils]: 77: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,350 INFO L290 TraceCheckUtils]: 76: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,350 INFO L290 TraceCheckUtils]: 75: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,350 INFO L272 TraceCheckUtils]: 74: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,350 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11610#true} {11804#(<= ~counter~0 3)} #61#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,351 INFO L290 TraceCheckUtils]: 70: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,351 INFO L272 TraceCheckUtils]: 69: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,351 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11610#true} {11804#(<= ~counter~0 3)} #59#return; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,351 INFO L272 TraceCheckUtils]: 64: Hoare triple {11804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {11804#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {11719#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11804#(<= ~counter~0 3)} is VALID [2022-04-28 11:16:54,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {11719#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,353 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11610#true} {11719#(<= ~counter~0 2)} #67#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,353 INFO L272 TraceCheckUtils]: 56: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,353 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11610#true} {11719#(<= ~counter~0 2)} #65#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,354 INFO L272 TraceCheckUtils]: 51: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,354 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11610#true} {11719#(<= ~counter~0 2)} #63#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,355 INFO L272 TraceCheckUtils]: 46: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,355 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11610#true} {11719#(<= ~counter~0 2)} #61#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,355 INFO L272 TraceCheckUtils]: 41: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,356 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11610#true} {11719#(<= ~counter~0 2)} #59#return; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,356 INFO L272 TraceCheckUtils]: 36: Hoare triple {11719#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {11719#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {11634#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11719#(<= ~counter~0 2)} is VALID [2022-04-28 11:16:54,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {11634#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,357 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11610#true} {11634#(<= ~counter~0 1)} #67#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,358 INFO L272 TraceCheckUtils]: 28: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,358 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11610#true} {11634#(<= ~counter~0 1)} #65#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,358 INFO L272 TraceCheckUtils]: 23: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,359 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11610#true} {11634#(<= ~counter~0 1)} #63#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,359 INFO L272 TraceCheckUtils]: 18: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,360 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11610#true} {11634#(<= ~counter~0 1)} #61#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,360 INFO L272 TraceCheckUtils]: 13: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,360 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11610#true} {11634#(<= ~counter~0 1)} #59#return; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-04-28 11:16:54,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {11610#true} assume !(0 == ~cond); {11610#true} is VALID [2022-04-28 11:16:54,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {11610#true} ~cond := #in~cond; {11610#true} is VALID [2022-04-28 11:16:54,361 INFO L272 TraceCheckUtils]: 8: Hoare triple {11634#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11610#true} is VALID [2022-04-28 11:16:54,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {11634#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {11618#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11634#(<= ~counter~0 1)} is VALID [2022-04-28 11:16:54,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {11618#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:54,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {11618#(<= ~counter~0 0)} call #t~ret6 := main(); {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:54,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11618#(<= ~counter~0 0)} {11610#true} #81#return; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:54,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {11618#(<= ~counter~0 0)} assume true; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:54,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {11610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11618#(<= ~counter~0 0)} is VALID [2022-04-28 11:16:54,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {11610#true} call ULTIMATE.init(); {11610#true} is VALID [2022-04-28 11:16:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-28 11:16:54,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:54,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404301564] [2022-04-28 11:16:54,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:54,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925453128] [2022-04-28 11:16:54,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925453128] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:54,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:54,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 11:16:54,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:54,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120038887] [2022-04-28 11:16:54,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120038887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:54,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:54,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:16:54,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914519544] [2022-04-28 11:16:54,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 129 [2022-04-28 11:16:54,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:54,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:16:54,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:54,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:16:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:54,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:16:54,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:16:54,426 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:16:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:55,424 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2022-04-28 11:16:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:16:55,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 129 [2022-04-28 11:16:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:16:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-04-28 11:16:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:16:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2022-04-28 11:16:55,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 122 transitions. [2022-04-28 11:16:55,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:55,530 INFO L225 Difference]: With dead ends: 152 [2022-04-28 11:16:55,530 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 11:16:55,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:16:55,531 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 191 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:16:55,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 191 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:16:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 11:16:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-04-28 11:16:55,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:55,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:16:55,704 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:16:55,704 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:16:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:55,707 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2022-04-28 11:16:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-04-28 11:16:55,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:55,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:55,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 138 states. [2022-04-28 11:16:55,708 INFO L87 Difference]: Start difference. First operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 138 states. [2022-04-28 11:16:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:55,711 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2022-04-28 11:16:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-04-28 11:16:55,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:55,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:55,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:55,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 78 states have (on average 1.064102564102564) internal successors, (83), 81 states have internal predecessors, (83), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 11:16:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2022-04-28 11:16:55,715 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 129 [2022-04-28 11:16:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:55,716 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2022-04-28 11:16:55,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 7 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-28 11:16:55,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 154 transitions. [2022-04-28 11:16:58,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2022-04-28 11:16:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 11:16:58,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:58,292 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:16:58,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 11:16:58,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:58,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-28 11:16:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:58,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009279779] [2022-04-28 11:16:58,732 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:58,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 4 times [2022-04-28 11:16:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:58,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808631903] [2022-04-28 11:16:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:58,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:58,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044649166] [2022-04-28 11:16:58,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:16:58,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:58,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:58,748 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:16:58,749 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:17:22,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:17:22,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:22,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 11:17:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:22,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:07,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {13251#true} call ULTIMATE.init(); {13251#true} is VALID [2022-04-28 11:18:07,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {13251#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13251#true} is VALID [2022-04-28 11:18:07,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13251#true} {13251#true} #81#return; {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {13251#true} call #t~ret6 := main(); {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {13251#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {13251#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {13251#true} assume !!(#t~post5 < 5);havoc #t~post5; {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L272 TraceCheckUtils]: 8: Hoare triple {13251#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13251#true} {13251#true} #59#return; {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L272 TraceCheckUtils]: 13: Hoare triple {13251#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {13251#true} ~cond := #in~cond; {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,129 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} {13251#true} #61#return; {13309#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:18:07,129 INFO L272 TraceCheckUtils]: 18: Hoare triple {13309#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {13251#true} ~cond := #in~cond; {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,130 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} {13309#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:18:07,130 INFO L272 TraceCheckUtils]: 23: Hoare triple {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,132 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13251#true} {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:18:07,133 INFO L272 TraceCheckUtils]: 28: Hoare triple {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,133 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13251#true} {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-28 11:18:07,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {13325#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-28 11:18:07,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-28 11:18:07,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-28 11:18:07,138 INFO L272 TraceCheckUtils]: 36: Hoare triple {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,139 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13251#true} {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} #59#return; {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} is VALID [2022-04-28 11:18:07,140 INFO L272 TraceCheckUtils]: 41: Hoare triple {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {13251#true} ~cond := #in~cond; {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,142 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} {13359#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)))} #61#return; {13396#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,142 INFO L272 TraceCheckUtils]: 46: Hoare triple {13396#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {13251#true} ~cond := #in~cond; {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,144 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} {13396#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (<= (+ 5 (* main_~n~0 main_~n~0 main_~n~0) main_~y~0 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0 main_~x~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #63#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,144 INFO L272 TraceCheckUtils]: 51: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,145 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13251#true} {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #65#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,145 INFO L272 TraceCheckUtils]: 56: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,146 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13251#true} {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #67#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,153 INFO L272 TraceCheckUtils]: 64: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 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)); {13251#true} is VALID [2022-04-28 11:18:07,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,153 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13251#true} {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #59#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,153 INFO L272 TraceCheckUtils]: 69: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 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)); {13251#true} is VALID [2022-04-28 11:18:07,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {13251#true} ~cond := #in~cond; {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,155 INFO L290 TraceCheckUtils]: 72: Hoare triple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,155 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #61#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,155 INFO L272 TraceCheckUtils]: 74: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,157 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13251#true} {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #63#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,157 INFO L272 TraceCheckUtils]: 79: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,158 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13251#true} {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #65#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,158 INFO L272 TraceCheckUtils]: 84: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,158 INFO L290 TraceCheckUtils]: 85: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,158 INFO L290 TraceCheckUtils]: 86: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,158 INFO L290 TraceCheckUtils]: 87: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,159 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13251#true} {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #67#return; {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-28 11:18:07,164 INFO L290 TraceCheckUtils]: 89: Hoare triple {13412#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) main_~z~0) (+ 5 main_~y~0 (* main_~n~0 3))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,164 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,165 INFO L290 TraceCheckUtils]: 91: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} assume !!(#t~post5 < 5);havoc #t~post5; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,165 INFO L272 TraceCheckUtils]: 92: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,165 INFO L290 TraceCheckUtils]: 93: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,166 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13251#true} {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #59#return; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,166 INFO L272 TraceCheckUtils]: 97: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,166 INFO L290 TraceCheckUtils]: 98: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,166 INFO L290 TraceCheckUtils]: 99: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,166 INFO L290 TraceCheckUtils]: 100: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,167 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13251#true} {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #61#return; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,167 INFO L272 TraceCheckUtils]: 102: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,167 INFO L290 TraceCheckUtils]: 103: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,167 INFO L290 TraceCheckUtils]: 104: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,167 INFO L290 TraceCheckUtils]: 105: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,168 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13251#true} {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #63#return; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,168 INFO L272 TraceCheckUtils]: 107: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 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)); {13251#true} is VALID [2022-04-28 11:18:07,168 INFO L290 TraceCheckUtils]: 108: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,169 INFO L290 TraceCheckUtils]: 109: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,169 INFO L290 TraceCheckUtils]: 110: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,169 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13251#true} {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #65#return; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,170 INFO L272 TraceCheckUtils]: 112: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,170 INFO L290 TraceCheckUtils]: 113: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,170 INFO L290 TraceCheckUtils]: 114: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,170 INFO L290 TraceCheckUtils]: 115: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,171 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13251#true} {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #67#return; {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,171 INFO L290 TraceCheckUtils]: 117: Hoare triple {13530#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} assume !(~n~0 <= ~a~0); {13615#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} is VALID [2022-04-28 11:18:07,171 INFO L272 TraceCheckUtils]: 118: Hoare triple {13615#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,172 INFO L290 TraceCheckUtils]: 119: Hoare triple {13251#true} ~cond := #in~cond; {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:07,172 INFO L290 TraceCheckUtils]: 120: Hoare triple {13298#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,173 INFO L290 TraceCheckUtils]: 121: Hoare triple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:07,398 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13302#(not (= |__VERIFIER_assert_#in~cond| 0))} {13615#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ main_~y~0 (* (- 1) main_~z~0) 8 (* main_~n~0 3)) (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (- 6))) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))))} #69#return; {13631#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:18:07,398 INFO L272 TraceCheckUtils]: 123: Hoare triple {13631#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {13251#true} is VALID [2022-04-28 11:18:07,398 INFO L290 TraceCheckUtils]: 124: Hoare triple {13251#true} ~cond := #in~cond; {13251#true} is VALID [2022-04-28 11:18:07,398 INFO L290 TraceCheckUtils]: 125: Hoare triple {13251#true} assume !(0 == ~cond); {13251#true} is VALID [2022-04-28 11:18:07,398 INFO L290 TraceCheckUtils]: 126: Hoare triple {13251#true} assume true; {13251#true} is VALID [2022-04-28 11:18:07,399 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13251#true} {13631#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} #71#return; {13631#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:18:08,898 INFO L272 TraceCheckUtils]: 128: Hoare triple {13631#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {13650#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:08,899 INFO L290 TraceCheckUtils]: 129: Hoare triple {13650#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13654#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:08,899 INFO L290 TraceCheckUtils]: 130: Hoare triple {13654#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13252#false} is VALID [2022-04-28 11:18:08,899 INFO L290 TraceCheckUtils]: 131: Hoare triple {13252#false} assume !false; {13252#false} is VALID [2022-04-28 11:18:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 160 proven. 217 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-04-28 11:18:08,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808631903] [2022-04-28 11:18:12,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044649166] [2022-04-28 11:18:12,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044649166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:18:12,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:18:12,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 11:18:12,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:12,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009279779] [2022-04-28 11:18:12,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009279779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:12,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:12,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:18:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84126073] [2022-04-28 11:18:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 132 [2022-04-28 11:18:12,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:12,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:18:13,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:13,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:18:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:18:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:18:13,929 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:18:21,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:26,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:33,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:39,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:42,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:49,865 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:18:54,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:58,061 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2022-04-28 11:18:58,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:18:58,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 132 [2022-04-28 11:18:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:18:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 11:18:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:18:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-28 11:18:58,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-28 11:19:02,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:02,015 INFO L225 Difference]: With dead ends: 144 [2022-04-28 11:19:02,015 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 11:19:02,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 158 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-04-28 11:19:02,016 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 66 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:02,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 125 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 259 Invalid, 2 Unknown, 0 Unchecked, 18.0s Time] [2022-04-28 11:19:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 11:19:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-28 11:19:02,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:02,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:19:02,168 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:19:02,169 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:19:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,171 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-04-28 11:19:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-28 11:19:02,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:02,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:02,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 117 states. [2022-04-28 11:19:02,172 INFO L87 Difference]: Start difference. First operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 117 states. [2022-04-28 11:19:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,175 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-04-28 11:19:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-28 11:19:02,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:02,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:02,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:02,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 30 states have call successors, (30), 18 states have call predecessors, (30), 17 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:19:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-04-28 11:19:02,178 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 132 [2022-04-28 11:19:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:02,178 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-04-28 11:19:02,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-28 11:19:02,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 129 transitions. [2022-04-28 11:19:05,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 128 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-28 11:19:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-28 11:19:05,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:05,506 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:05,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 11:19:05,711 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,SelfDestructingSolverStorable17 [2022-04-28 11:19:05,712 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 9 times [2022-04-28 11:19:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:05,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33034685] [2022-04-28 11:19:05,936 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:05,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 10 times [2022-04-28 11:19:05,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:05,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198001168] [2022-04-28 11:19:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:05,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:05,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:05,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77549804] [2022-04-28 11:19:05,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:05,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:05,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:05,966 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:05,966 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:06,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:06,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 11:19:06,056 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 11:19:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 11:19:06,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 11:19:06,155 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 11:19:06,155 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 11:19:06,158 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:19:06,182 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:19:06,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:06,378 INFO L356 BasicCegarLoop]: Path program histogram: [10, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:19:06,381 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 11:19:06,401 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,402 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 11:19:06,403 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 11:19:06,404 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 11:19:06,404 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:19:06,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:19:06 BoogieIcfgContainer [2022-04-28 11:19:06,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:19:06,406 INFO L158 Benchmark]: Toolchain (without parser) took 316865.46ms. Allocated memory was 187.7MB in the beginning and 363.9MB in the end (delta: 176.2MB). Free memory was 137.9MB in the beginning and 322.9MB in the end (delta: -185.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:19:06,406 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 187.7MB. Free memory was 154.0MB in the beginning and 153.9MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:19:06,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.61ms. Allocated memory was 187.7MB in the beginning and 303.0MB in the end (delta: 115.3MB). Free memory was 137.6MB in the beginning and 277.6MB in the end (delta: -140.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 11:19:06,407 INFO L158 Benchmark]: Boogie Preprocessor took 49.15ms. Allocated memory is still 303.0MB. Free memory was 277.6MB in the beginning and 276.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 11:19:06,407 INFO L158 Benchmark]: RCFGBuilder took 324.43ms. Allocated memory is still 303.0MB. Free memory was 276.1MB in the beginning and 263.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:19:06,407 INFO L158 Benchmark]: TraceAbstraction took 315999.60ms. Allocated memory was 303.0MB in the beginning and 363.9MB in the end (delta: 60.8MB). Free memory was 263.0MB in the beginning and 322.9MB in the end (delta: -60.0MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. [2022-04-28 11:19:06,408 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.16ms. Allocated memory is still 187.7MB. Free memory was 154.0MB in the beginning and 153.9MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 485.61ms. Allocated memory was 187.7MB in the beginning and 303.0MB in the end (delta: 115.3MB). Free memory was 137.6MB in the beginning and 277.6MB in the end (delta: -140.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.15ms. Allocated memory is still 303.0MB. Free memory was 277.6MB in the beginning and 276.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 324.43ms. Allocated memory is still 303.0MB. Free memory was 276.1MB in the beginning and 263.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 315999.60ms. Allocated memory was 303.0MB in the beginning and 363.9MB in the end (delta: 60.8MB). Free memory was 263.0MB in the beginning and 322.9MB in the end (delta: -60.0MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 [L33] EXPR counter++ [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(z == 6 * n + 6) [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L36] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(x == n * n * n) [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 [L33] EXPR counter++ [L33] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(z == 6*n + 6) [L15] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(z == 6*n + 6) [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) [L15] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 315.9s, OverallIterations: 19, TraceHistogramMax: 27, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 96.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 39.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 2289 SdHoareTripleChecker+Invalid, 39.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1564 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2307 IncrementalHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 725 mSDtfsCounter, 2307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1954 GetRequests, 1762 SyntacticMatches, 21 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=17, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 33 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 11:19:06,458 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...