/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_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:14:07,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:14:07,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:14:08,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:14:08,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:14:08,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:14:08,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:14:08,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:14:08,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:14:08,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:14:08,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:14:08,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:14:08,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:14:08,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:14:08,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:14:08,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:14:08,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:14:08,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:14:08,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:14:08,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:14:08,092 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:14:08,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:14:08,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:14:08,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:14:08,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:14:08,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:14:08,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:14:08,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:14:08,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:14:08,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:14:08,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:14:08,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:14:08,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:14:08,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:14:08,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:14:08,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:14:08,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:14:08,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:14:08,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:14:08,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:14:08,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:14:08,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:14:08,114 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:14:08,123 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:14:08,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:14:08,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:14:08,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:14:08,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:14:08,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:14:08,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:14:08,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:14:08,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:14:08,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:14:08,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:14:08,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:14:08,126 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:14:08,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:14:08,127 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:14:08,127 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:14:08,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:14:08,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:14:08,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:14:08,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:14:08,345 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:14:08,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound1.c [2022-04-28 11:14:08,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e478e65b0/b2d7102c94494dd4a850c952932fa615/FLAG5c778dc6f [2022-04-28 11:14:08,726 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:14:08,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound1.c [2022-04-28 11:14:08,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e478e65b0/b2d7102c94494dd4a850c952932fa615/FLAG5c778dc6f [2022-04-28 11:14:09,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e478e65b0/b2d7102c94494dd4a850c952932fa615 [2022-04-28 11:14:09,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:14:09,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:14:09,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:14:09,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:14:09,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:14:09,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@970eb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09, skipping insertion in model container [2022-04-28 11:14:09,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:14:09,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:14:09,360 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_valuebound1.c[588,601] [2022-04-28 11:14:09,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:14:09,383 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:14:09,392 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_valuebound1.c[588,601] [2022-04-28 11:14:09,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:14:09,412 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:14:09,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09 WrapperNode [2022-04-28 11:14:09,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:14:09,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:14:09,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:14:09,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:14:09,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:14:09,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:14:09,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:14:09,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:14:09,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (1/1) ... [2022-04-28 11:14:09,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:14:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:09,500 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:14:09,528 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:14:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:14:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:14:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:14:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:14:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:14:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:14:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:14:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:14:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:14:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:14:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:14:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:14:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:14:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:14:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:14:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:14:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:14:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:14:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:14:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:14:09,588 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:14:09,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:14:09,723 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:14:09,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:14:09,728 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:14:09,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:14:09 BoogieIcfgContainer [2022-04-28 11:14:09,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:14:09,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:14:09,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:14:09,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:14:09,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:14:09" (1/3) ... [2022-04-28 11:14:09,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17326b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:14:09, skipping insertion in model container [2022-04-28 11:14:09,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:14:09" (2/3) ... [2022-04-28 11:14:09,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17326b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:14:09, skipping insertion in model container [2022-04-28 11:14:09,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:14:09" (3/3) ... [2022-04-28 11:14:09,734 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound1.c [2022-04-28 11:14:09,742 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:14:09,742 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:14:09,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:14:09,773 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@160d3ece, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4783e0b9 [2022-04-28 11:14:09,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:14:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:14:09,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:09,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:09,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 11:14:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:09,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803634916] [2022-04-28 11:14:09,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 11:14:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:09,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563549275] [2022-04-28 11:14:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:09,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:14:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:09,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 11:14:09,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:14:09,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:14:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:14:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:10,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:14:10,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:14:10,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:14:10,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:14:10,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:14:10,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 11:14:10,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:14:10,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:14:10,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 11:14:10,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {39#true} is VALID [2022-04-28 11:14:10,008 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {39#true} is VALID [2022-04-28 11:14:10,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:14:10,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:14:10,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:14:10,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:14:10,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-28 11:14:10,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 11:14:10,010 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-28 11:14:10,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 11:14:10,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 11:14:10,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 11:14:10,012 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:14:10,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:10,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563549275] [2022-04-28 11:14:10,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563549275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:10,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:10,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:14:10,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:10,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [803634916] [2022-04-28 11:14:10,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [803634916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:10,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:10,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:14:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069098276] [2022-04-28 11:14:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:10,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:10,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:10,049 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:14:10,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:14:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:10,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:14:10,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:14:10,067 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:10,271 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 11:14:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:14:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:14:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:14:10,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:14:10,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:10,405 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:14:10,406 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 11:14:10,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:14:10,410 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:10,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 11:14:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 11:14:10,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:10,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:10,431 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:10,432 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:10,436 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:14:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:14:10,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:10,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:10,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:14:10,437 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:14:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:10,441 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:14:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:14:10,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:10,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:10,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:10,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 11:14:10,449 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 11:14:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:10,449 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 11:14:10,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:10,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 11:14:10,488 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:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:14:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:14:10,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:10,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:10,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:14:10,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 11:14:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:10,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661764795] [2022-04-28 11:14:10,491 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 11:14:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:10,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070787459] [2022-04-28 11:14:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:14:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:10,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-28 11:14:10,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:10,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:14:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:14:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:10,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:14:10,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:14:10,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:10,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:14:10,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:14:10,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-28 11:14:10,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:10,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:14:10,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 11:14:10,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {301#true} is VALID [2022-04-28 11:14:10,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {301#true} is VALID [2022-04-28 11:14:10,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:14:10,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:14:10,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:14:10,589 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:14:10,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:14:10,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:14:10,591 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:10,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:10,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 11:14:10,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 11:14:10,592 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:14:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:10,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070787459] [2022-04-28 11:14:10,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070787459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:10,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:10,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:10,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:10,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661764795] [2022-04-28 11:14:10,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661764795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:10,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:10,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450534760] [2022-04-28 11:14:10,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:10,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:10,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:10,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:10,607 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:14:10,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:14:10,608 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:11,037 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 11:14:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:11,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:14:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:14:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:14:11,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 11:14:11,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:11,106 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:14:11,106 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:14:11,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:11,107 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:11,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:14:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:14:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:14:11,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:11,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:11,129 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:11,129 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:11,132 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:14:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:14:11,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:11,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:11,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:14:11,133 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:14:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:11,136 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:14:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:14:11,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:11,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:11,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:11,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:14:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:14:11,146 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 11:14:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:11,146 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:14:11,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:14:11,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:14:11,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:14:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:14:11,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:11,188 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:11,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:14:11,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 11:14:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:11,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157734202] [2022-04-28 11:14:11,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:11,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 11:14:11,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:11,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141940029] [2022-04-28 11:14:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:11,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:11,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:11,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072184876] [2022-04-28 11:14:11,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:11,204 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:14:11,205 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:14:11,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:11,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:11,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:14:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:11,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:11,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 11:14:11,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-28 11:14:11,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:14:11,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 11:14:11,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 11:14:11,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {538#true} is VALID [2022-04-28 11:14:11,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {538#true} is VALID [2022-04-28 11:14:11,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:14:11,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:14:11,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:14:11,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 11:14:11,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:11,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:11,412 INFO L272 TraceCheckUtils]: 13: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {538#true} is VALID [2022-04-28 11:14:11,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:14:11,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:14:11,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:14:11,413 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {538#true} {576#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:11,414 INFO L272 TraceCheckUtils]: 18: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:11,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:11,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 11:14:11,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 11:14:11,415 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:14:11,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:11,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:11,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141940029] [2022-04-28 11:14:11,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:11,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072184876] [2022-04-28 11:14:11,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072184876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:11,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:11,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:11,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157734202] [2022-04-28 11:14:11,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157734202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:11,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:11,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:11,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944429149] [2022-04-28 11:14:11,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:11,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:14:11,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:11,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:11,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:11,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:11,440 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:11,633 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:14:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 11:14:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:11,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:14:11,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:11,696 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:14:11,696 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:14:11,697 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:14:11,698 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:11,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:14:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 11:14:11,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:11,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:11,709 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:11,709 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:11,718 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:14:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:14:11,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:11,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:11,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:14:11,720 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:14:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:11,722 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:14:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:14:11,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:11,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:11,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:11,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:14:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 11:14:11,725 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 11:14:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:11,726 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 11:14:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:14:11,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 11:14:11,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 11:14:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:14:11,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:11,784 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:11,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:14:12,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:12,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 11:14:12,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:12,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459437028] [2022-04-28 11:14:12,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 11:14:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:12,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397357868] [2022-04-28 11:14:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:12,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:12,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083452316] [2022-04-28 11:14:12,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:12,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:12,021 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:14:12,022 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:14:12,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:12,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:12,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:14:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:12,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:12,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 11:14:12,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-28 11:14:12,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:12,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 11:14:12,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 11:14:12,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {906#true} is VALID [2022-04-28 11:14:12,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {906#true} is VALID [2022-04-28 11:14:12,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:14:12,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:14:12,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:12,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 11:14:12,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:12,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:12,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {906#true} is VALID [2022-04-28 11:14:12,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:14:12,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:14:12,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:12,158 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:12,159 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {906#true} is VALID [2022-04-28 11:14:12,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:14:12,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:14:12,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:14:12,160 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:14:12,160 INFO L272 TraceCheckUtils]: 23: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:12,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:12,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 11:14:12,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 11:14:12,161 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:14:12,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:12,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:12,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397357868] [2022-04-28 11:14:12,162 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:12,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083452316] [2022-04-28 11:14:12,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083452316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:12,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:12,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:12,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:12,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459437028] [2022-04-28 11:14:12,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459437028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:12,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:12,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71679957] [2022-04-28 11:14:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:12,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:14:12,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:12,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:12,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:12,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:12,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:12,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:12,180 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:12,389 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 11:14:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:12,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 11:14:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:12,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:14:12,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:12,446 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:14:12,446 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:14:12,446 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:14:12,447 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:12,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:14:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:14:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 11:14:12,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:12,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:12,460 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:12,461 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:12,463 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:14:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:14:12,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:12,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:12,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:14:12,464 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:14:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:12,466 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:14:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:14:12,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:12,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:12,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:12,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 11:14:12,469 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 11:14:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:12,469 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 11:14:12,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:14:12,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 11:14:12,545 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:14:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 11:14:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:14:12,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:12,545 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:12,561 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:14:12,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 11:14:12,762 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 11:14:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:12,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1224837584] [2022-04-28 11:14:12,763 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:14:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 11:14:12,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:12,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383920947] [2022-04-28 11:14:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:12,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:12,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803722172] [2022-04-28 11:14:12,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:12,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:12,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:12,788 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:14:12,789 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:14:12,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:12,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:12,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:14:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:12,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:12,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 11:14:12,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1325#true} is VALID [2022-04-28 11:14:12,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1325#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:12,999 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 11:14:13,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:13,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:13,002 INFO L272 TraceCheckUtils]: 13: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:14:13,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:13,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:13,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:13,003 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:13,003 INFO L272 TraceCheckUtils]: 18: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1325#true} is VALID [2022-04-28 11:14:13,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:13,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:13,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:13,004 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:13,004 INFO L272 TraceCheckUtils]: 23: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:14:13,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:14:13,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:14:13,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:14:13,012 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:13,012 INFO L272 TraceCheckUtils]: 28: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:13,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:13,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 11:14:13,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 11:14:13,013 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:14:13,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383920947] [2022-04-28 11:14:13,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803722172] [2022-04-28 11:14:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803722172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:13,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:13,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:13,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1224837584] [2022-04-28 11:14:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1224837584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:13,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:14:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596538537] [2022-04-28 11:14:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:13,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:14:13,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:13,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:13,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:13,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:14:13,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:13,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:14:13,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:14:13,036 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:13,296 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 11:14:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:14:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:14:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:14:13,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:14:13,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:13,363 INFO L225 Difference]: With dead ends: 66 [2022-04-28 11:14:13,364 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:14:13,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:14:13,367 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:13,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:14:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 11:14:13,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:13,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:13,393 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:13,393 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:13,398 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:14:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:14:13,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:13,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:13,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:14:13,400 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:14:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:13,404 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:14:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:14:13,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:13,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:13,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:13,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:14:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 11:14:13,408 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 11:14:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:13,408 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 11:14:13,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:14:13,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 11:14:13,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:14:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:14:13,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:13,477 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:13,503 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:14:13,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:13,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 11:14:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:13,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2096066779] [2022-04-28 11:14:14,013 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:14,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 2 times [2022-04-28 11:14:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:14,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502194058] [2022-04-28 11:14:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:14,035 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:14,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086803344] [2022-04-28 11:14:14,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:14,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:14,038 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:14:14,090 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:14:14,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:14,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:14,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:14:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:14,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:14,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:14:14,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-28 11:14:14,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:14:14,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:14:14,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1775#true} is VALID [2022-04-28 11:14:14,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:14:14,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:14,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:14,278 INFO L272 TraceCheckUtils]: 13: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,279 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:14,279 INFO L272 TraceCheckUtils]: 18: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,279 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:14,279 INFO L272 TraceCheckUtils]: 23: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,280 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:14,280 INFO L272 TraceCheckUtils]: 28: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,281 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:14,281 INFO L272 TraceCheckUtils]: 33: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,282 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:14,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:14,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !false; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:14,283 INFO L272 TraceCheckUtils]: 40: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,283 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} #62#return; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:14,284 INFO L272 TraceCheckUtils]: 45: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:14,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:14,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:14:14,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:14:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:14:14,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:14,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:14:14,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:14:14,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:14,425 INFO L272 TraceCheckUtils]: 45: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:14,425 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:14,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,426 INFO L272 TraceCheckUtils]: 40: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:14,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:14,442 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:14,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,442 INFO L272 TraceCheckUtils]: 33: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,443 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:14,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,443 INFO L272 TraceCheckUtils]: 28: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,445 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:14,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,445 INFO L272 TraceCheckUtils]: 23: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,446 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:14,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,446 INFO L272 TraceCheckUtils]: 18: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,446 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:14,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,447 INFO L272 TraceCheckUtils]: 13: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:14,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:14,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:14:14,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-28 11:14:14,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:14:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:14:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:14,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502194058] [2022-04-28 11:14:14,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:14,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086803344] [2022-04-28 11:14:14,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086803344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:14,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:14,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:14:14,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2096066779] [2022-04-28 11:14:14,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2096066779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:14,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:14,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978639912] [2022-04-28 11:14:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:14:14,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:14,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:14,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:14,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:14,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:14,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:14,468 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:14,789 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 11:14:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:14,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:14:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:14,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:14:14,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:14,852 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:14:14,852 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 11:14:14,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:14,853 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:14,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 11:14:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-04-28 11:14:14,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:14,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:14,880 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:14,880 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:14,883 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:14:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:14:14,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:14,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:14,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:14:14,883 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:14:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:14,886 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:14:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:14:14,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:14,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:14,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:14,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-04-28 11:14:14,888 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2022-04-28 11:14:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:14,888 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-04-28 11:14:14,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:14:14,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 79 transitions. [2022-04-28 11:14:14,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 11:14:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 11:14:14,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:14,969 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:15,000 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:14:15,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:15,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 3 times [2022-04-28 11:14:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:15,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493185489] [2022-04-28 11:14:15,472 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:15,472 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 4 times [2022-04-28 11:14:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:15,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757465335] [2022-04-28 11:14:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:15,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:15,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:15,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36844323] [2022-04-28 11:14:15,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:15,481 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:14:15,482 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:14:15,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:15,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:15,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:14:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:15,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:15,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,727 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:14:15,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:15,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:15,728 INFO L272 TraceCheckUtils]: 13: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,729 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:15,729 INFO L272 TraceCheckUtils]: 18: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,730 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:15,730 INFO L272 TraceCheckUtils]: 23: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,732 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:15,732 INFO L272 TraceCheckUtils]: 28: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,735 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:15,736 INFO L272 TraceCheckUtils]: 33: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,736 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:14:15,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:15,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} assume !false; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:15,737 INFO L272 TraceCheckUtils]: 40: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,738 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #62#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:15,738 INFO L272 TraceCheckUtils]: 45: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,739 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #64#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:14:15,740 INFO L272 TraceCheckUtils]: 50: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:15,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:15,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:14:15,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:14:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:14:15,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:15,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:14:15,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:14:15,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:15,922 INFO L272 TraceCheckUtils]: 50: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:15,922 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:15,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,922 INFO L272 TraceCheckUtils]: 45: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,923 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:15,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,923 INFO L272 TraceCheckUtils]: 40: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:15,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:15,926 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:15,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,926 INFO L272 TraceCheckUtils]: 33: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,927 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:15,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,927 INFO L272 TraceCheckUtils]: 28: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,927 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:15,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,928 INFO L272 TraceCheckUtils]: 23: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,928 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:15,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,929 INFO L272 TraceCheckUtils]: 18: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,930 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:15,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,930 INFO L272 TraceCheckUtils]: 13: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:15,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:15,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:14:15,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:14:15,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2536#true} is VALID [2022-04-28 11:14:15,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:14:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:14:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757465335] [2022-04-28 11:14:15,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36844323] [2022-04-28 11:14:15,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36844323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:15,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:15,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:14:15,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493185489] [2022-04-28 11:14:15,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493185489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:15,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:15,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:15,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994853810] [2022-04-28 11:14:15,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:15,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:14:15,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:15,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:15,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:15,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:15,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:15,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:15,960 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:16,328 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 11:14:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:16,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:14:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:16,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:14:16,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:16,390 INFO L225 Difference]: With dead ends: 85 [2022-04-28 11:14:16,390 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 11:14:16,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:16,390 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:16,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 196 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 11:14:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 11:14:16,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:16,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:16,417 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:16,417 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:16,419 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:14:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:14:16,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:16,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:16,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:14:16,420 INFO L87 Difference]: Start difference. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:14:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:16,422 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:14:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:14:16,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:16,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:16,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:16,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:14:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-04-28 11:14:16,425 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 54 [2022-04-28 11:14:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:16,425 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-04-28 11:14:16,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:14:16,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 84 transitions. [2022-04-28 11:14:16,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-04-28 11:14:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:14:16,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:16,506 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:16,540 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:14:16,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:16,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 5 times [2022-04-28 11:14:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:16,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409600740] [2022-04-28 11:14:16,980 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:16,980 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 6 times [2022-04-28 11:14:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:16,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959748700] [2022-04-28 11:14:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:16,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:16,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319365613] [2022-04-28 11:14:16,990 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:14:16,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:16,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:17,012 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:14:17,013 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:14:17,043 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:14:17,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:17,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:14:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:17,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:17,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:14:17,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 11:14:17,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:14:17,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:14:17,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {3353#true} is VALID [2022-04-28 11:14:17,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:14:17,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:17,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:17,304 INFO L272 TraceCheckUtils]: 13: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,304 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:17,305 INFO L272 TraceCheckUtils]: 18: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,305 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:17,305 INFO L272 TraceCheckUtils]: 23: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,306 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:17,306 INFO L272 TraceCheckUtils]: 28: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,307 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:17,307 INFO L272 TraceCheckUtils]: 33: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,308 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:17,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:17,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} assume !false; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:17,309 INFO L272 TraceCheckUtils]: 40: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,312 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #62#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:17,312 INFO L272 TraceCheckUtils]: 45: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,314 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #64#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:17,314 INFO L272 TraceCheckUtils]: 50: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,315 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #66#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:14:17,315 INFO L272 TraceCheckUtils]: 55: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:17,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:17,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:14:17,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:14:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:14:17,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:17,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:14:17,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:14:17,581 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:17,582 INFO L272 TraceCheckUtils]: 55: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:17,582 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:17,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,583 INFO L272 TraceCheckUtils]: 50: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,584 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:17,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,584 INFO L272 TraceCheckUtils]: 45: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,585 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:17,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,585 INFO L272 TraceCheckUtils]: 40: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:17,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:17,589 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #70#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:17,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,589 INFO L272 TraceCheckUtils]: 33: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,589 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #68#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:17,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,590 INFO L272 TraceCheckUtils]: 28: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,590 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #66#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:17,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,591 INFO L272 TraceCheckUtils]: 23: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,591 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #64#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:17,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,592 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #62#return; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:17,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,592 INFO L272 TraceCheckUtils]: 13: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !false; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:17,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3597#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:17,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:14:17,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:14:17,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:14:17,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:14:17,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {3353#true} is VALID [2022-04-28 11:14:17,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:14:17,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:14:17,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:14:17,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3353#true} is VALID [2022-04-28 11:14:17,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:14:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:14:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:17,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959748700] [2022-04-28 11:14:17,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:17,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319365613] [2022-04-28 11:14:17,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319365613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:17,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:17,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:14:17,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:17,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409600740] [2022-04-28 11:14:17,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409600740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:17,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:17,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:14:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516546773] [2022-04-28 11:14:17,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:17,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:14:17,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:17,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:17,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:17,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:14:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:17,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:14:17,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:17,625 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:18,026 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 11:14:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:14:18,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:14:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:14:18,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:14:18,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:18,078 INFO L225 Difference]: With dead ends: 89 [2022-04-28 11:14:18,078 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:14:18,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:18,079 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:18,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:14:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 11:14:18,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:18,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:18,104 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:18,105 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:18,107 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:14:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:14:18,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:18,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:18,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:14:18,108 INFO L87 Difference]: Start difference. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:14:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:18,111 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:14:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:14:18,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:18,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:18,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:18,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-28 11:14:18,115 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 59 [2022-04-28 11:14:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:18,115 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-28 11:14:18,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:14:18,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-28 11:14:18,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:14:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 11:14:18,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:18,203 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:18,219 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:18,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:18,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-28 11:14:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:18,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328644122] [2022-04-28 11:14:18,603 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:18,603 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 2 times [2022-04-28 11:14:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:18,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032968545] [2022-04-28 11:14:18,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:18,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:18,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802536354] [2022-04-28 11:14:18,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:18,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:18,636 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:18,637 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:18,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:18,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:18,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:14:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:18,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:19,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {4230#true} call ULTIMATE.init(); {4230#true} is VALID [2022-04-28 11:14:19,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {4230#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4230#true} {4230#true} #84#return; {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {4230#true} call #t~ret5 := main(); {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {4230#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {4230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4230#true} {4230#true} #60#return; {4230#true} is VALID [2022-04-28 11:14:19,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {4230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:19,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:19,095 INFO L272 TraceCheckUtils]: 13: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,096 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:19,096 INFO L272 TraceCheckUtils]: 18: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,097 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:19,097 INFO L272 TraceCheckUtils]: 23: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,097 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:19,097 INFO L272 TraceCheckUtils]: 28: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,098 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:19,098 INFO L272 TraceCheckUtils]: 33: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,099 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:19,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:19,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:19,100 INFO L272 TraceCheckUtils]: 40: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,101 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:19,101 INFO L272 TraceCheckUtils]: 45: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,102 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:19,102 INFO L272 TraceCheckUtils]: 50: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,102 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:19,103 INFO L272 TraceCheckUtils]: 55: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,109 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:19,109 INFO L272 TraceCheckUtils]: 60: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,110 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:19,110 INFO L290 TraceCheckUtils]: 65: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:19,110 INFO L272 TraceCheckUtils]: 66: Hoare triple {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:14:19,110 INFO L290 TraceCheckUtils]: 67: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:14:19,110 INFO L290 TraceCheckUtils]: 68: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:14:19,110 INFO L290 TraceCheckUtils]: 69: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:14:19,111 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4230#true} {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:19,112 INFO L272 TraceCheckUtils]: 71: Hoare triple {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:19,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4455#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:19,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {4455#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4231#false} is VALID [2022-04-28 11:14:19,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {4231#false} assume !false; {4231#false} is VALID [2022-04-28 11:14:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:14:19,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:19,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032968545] [2022-04-28 11:14:19,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:19,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802536354] [2022-04-28 11:14:19,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802536354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:19,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:19,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:19,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:19,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328644122] [2022-04-28 11:14:19,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328644122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:19,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:19,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420900609] [2022-04-28 11:14:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:19,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-28 11:14:19,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:19,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:19,488 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:14:19,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:19,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:19,489 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:19,960 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 11:14:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-04-28 11:14:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:14:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:14:19,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:14:20,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:20,055 INFO L225 Difference]: With dead ends: 94 [2022-04-28 11:14:20,055 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 11:14:20,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:20,057 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:20,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 11:14:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 11:14:20,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:20,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:20,104 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:20,104 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:20,107 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:14:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:14:20,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:20,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:20,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:14:20,109 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:14:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:20,113 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:14:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:14:20,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:20,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:20,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:20,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-04-28 11:14:20,118 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 75 [2022-04-28 11:14:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:20,118 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-04-28 11:14:20,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:20,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 104 transitions. [2022-04-28 11:14:20,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:14:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:14:20,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:20,232 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:20,269 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:20,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:20,433 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 7 times [2022-04-28 11:14:20,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:20,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [137758579] [2022-04-28 11:14:20,766 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:20,766 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 8 times [2022-04-28 11:14:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:20,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767954249] [2022-04-28 11:14:20,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:20,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:20,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875255468] [2022-04-28 11:14:20,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:20,792 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:20,792 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:20,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:20,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:20,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 11:14:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:20,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:21,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:14:21,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5138#true} is VALID [2022-04-28 11:14:21,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:14:21,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:14:21,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5138#true} is VALID [2022-04-28 11:14:21,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:14:21,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:14:21,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !false; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:14:21,214 INFO L272 TraceCheckUtils]: 13: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,215 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #62#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:14:21,215 INFO L272 TraceCheckUtils]: 18: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,216 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #64#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:14:21,216 INFO L272 TraceCheckUtils]: 23: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,216 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #66#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:14:21,216 INFO L272 TraceCheckUtils]: 28: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,217 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #68#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:14:21,217 INFO L272 TraceCheckUtils]: 33: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,218 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} #70#return; {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} is VALID [2022-04-28 11:14:21,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {5176#(and (= main_~n~0 0) (= main_~z~0 6) (<= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:21,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} assume !false; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:21,219 INFO L272 TraceCheckUtils]: 40: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,220 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #62#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:21,220 INFO L272 TraceCheckUtils]: 45: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,220 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #64#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:21,220 INFO L272 TraceCheckUtils]: 50: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,221 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #66#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:21,221 INFO L272 TraceCheckUtils]: 55: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,222 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #68#return; {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} is VALID [2022-04-28 11:14:21,222 INFO L272 TraceCheckUtils]: 60: Hoare triple {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:21,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {5328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:21,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:21,224 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5258#(and (= (+ main_~z~0 (- 6)) 6) (<= (+ 5 main_~y~0) main_~z~0) (= main_~n~0 1))} #70#return; {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} is VALID [2022-04-28 11:14:21,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {5339#(and (= main_~z~0 12) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:14:21,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} assume !false; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:14:21,225 INFO L272 TraceCheckUtils]: 67: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:21,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:21,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:21,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:21,226 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} #62#return; {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} is VALID [2022-04-28 11:14:21,226 INFO L272 TraceCheckUtils]: 72: Hoare triple {5343#(and (= (+ (- 1) main_~n~0) 1) (= (+ (* main_~y~0 12) (- 72)) 156))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:21,227 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:21,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:14:21,227 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:14:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:14:21,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:22,105 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:14:22,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {5369#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:14:22,106 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5369#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:22,107 INFO L272 TraceCheckUtils]: 72: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5365#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:22,107 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:22,107 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,107 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,108 INFO L272 TraceCheckUtils]: 67: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:22,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {5407#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5385#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:14:22,113 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {5407#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:14:22,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:22,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:22,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5421#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:22,114 INFO L272 TraceCheckUtils]: 60: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,115 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:22,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,115 INFO L272 TraceCheckUtils]: 55: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,115 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:22,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,116 INFO L272 TraceCheckUtils]: 50: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,116 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:22,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,117 INFO L272 TraceCheckUtils]: 45: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,117 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:22,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,117 INFO L272 TraceCheckUtils]: 40: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:22,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5411#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:22,127 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #70#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:14:22,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,127 INFO L272 TraceCheckUtils]: 33: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,128 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #68#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:14:22,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,128 INFO L272 TraceCheckUtils]: 28: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,129 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #66#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:14:22,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,129 INFO L272 TraceCheckUtils]: 23: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,129 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #64#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:14:22,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,130 INFO L272 TraceCheckUtils]: 18: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,132 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #62#return; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:14:22,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,132 INFO L272 TraceCheckUtils]: 13: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !false; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:14:22,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5491#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:14:22,133 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:14:22,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:14:22,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:14:22,133 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:14:22,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {5138#true} is VALID [2022-04-28 11:14:22,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:14:22,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:14:22,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:14:22,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5138#true} is VALID [2022-04-28 11:14:22,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:14:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 11:14:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:22,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767954249] [2022-04-28 11:14:22,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:22,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875255468] [2022-04-28 11:14:22,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875255468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:22,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:22,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-28 11:14:22,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:22,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [137758579] [2022-04-28 11:14:22,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [137758579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:22,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:22,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:14:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139526440] [2022-04-28 11:14:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:22,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:22,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:22,172 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:14:22,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:14:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:22,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:14:22,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:14:22,173 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:23,363 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-28 11:14:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:14:23,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-28 11:14:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:14:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-28 11:14:23,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-28 11:14:23,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:23,446 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:14:23,446 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 11:14:23,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:14:23,447 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:23,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 151 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:14:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 11:14:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 11:14:23,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:23,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:23,510 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:23,510 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:23,512 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:14:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:14:23,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:23,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:23,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:14:23,513 INFO L87 Difference]: Start difference. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:14:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:23,515 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:14:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:14:23,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:23,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:23,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:23,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:14:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-28 11:14:23,518 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 76 [2022-04-28 11:14:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:23,518 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-28 11:14:23,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 11:14:23,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-28 11:14:23,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-28 11:14:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 11:14:23,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:23,636 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:23,656 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:23,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:14:23,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-28 11:14:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:23,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118471271] [2022-04-28 11:14:24,063 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:24,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 2 times [2022-04-28 11:14:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:24,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180616034] [2022-04-28 11:14:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:24,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:24,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717174274] [2022-04-28 11:14:24,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:24,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:24,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:24,086 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:24,087 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:24,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:24,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:24,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:14:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:24,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:24,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {6274#true} call ULTIMATE.init(); {6274#true} is VALID [2022-04-28 11:14:24,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {6274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6274#true} is VALID [2022-04-28 11:14:24,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6274#true} {6274#true} #84#return; {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {6274#true} call #t~ret5 := main(); {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {6274#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L272 TraceCheckUtils]: 6: Hoare triple {6274#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6274#true} {6274#true} #60#return; {6274#true} is VALID [2022-04-28 11:14:24,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {6274#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:24,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !false; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:24,690 INFO L272 TraceCheckUtils]: 13: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,690 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #62#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:24,690 INFO L272 TraceCheckUtils]: 18: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,691 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #64#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:24,691 INFO L272 TraceCheckUtils]: 23: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,701 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #66#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:24,701 INFO L272 TraceCheckUtils]: 28: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,702 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #68#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:24,702 INFO L272 TraceCheckUtils]: 33: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,703 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6274#true} {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #70#return; {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-28 11:14:24,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {6312#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:24,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !false; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:24,704 INFO L272 TraceCheckUtils]: 40: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,705 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #62#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:24,705 INFO L272 TraceCheckUtils]: 45: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,706 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #64#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:24,706 INFO L272 TraceCheckUtils]: 50: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,706 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #66#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:24,706 INFO L272 TraceCheckUtils]: 55: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,707 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #68#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:24,707 INFO L272 TraceCheckUtils]: 60: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,707 INFO L290 TraceCheckUtils]: 63: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,708 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6274#true} {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #70#return; {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:14:24,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {6394#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:24,709 INFO L272 TraceCheckUtils]: 66: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,709 INFO L290 TraceCheckUtils]: 67: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,709 INFO L290 TraceCheckUtils]: 69: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,709 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #72#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:24,709 INFO L272 TraceCheckUtils]: 71: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6274#true} is VALID [2022-04-28 11:14:24,709 INFO L290 TraceCheckUtils]: 72: Hoare triple {6274#true} ~cond := #in~cond; {6274#true} is VALID [2022-04-28 11:14:24,709 INFO L290 TraceCheckUtils]: 73: Hoare triple {6274#true} assume !(0 == ~cond); {6274#true} is VALID [2022-04-28 11:14:24,709 INFO L290 TraceCheckUtils]: 74: Hoare triple {6274#true} assume true; {6274#true} is VALID [2022-04-28 11:14:24,710 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6274#true} {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #74#return; {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-28 11:14:24,711 INFO L272 TraceCheckUtils]: 76: Hoare triple {6476#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:24,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {6510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:24,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {6514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6275#false} is VALID [2022-04-28 11:14:24,712 INFO L290 TraceCheckUtils]: 79: Hoare triple {6275#false} assume !false; {6275#false} is VALID [2022-04-28 11:14:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:14:24,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:27,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180616034] [2022-04-28 11:14:27,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:27,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717174274] [2022-04-28 11:14:27,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717174274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:27,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:27,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:14:27,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:27,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118471271] [2022-04-28 11:14:27,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118471271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:27,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:27,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597114108] [2022-04-28 11:14:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:14:27,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:27,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:27,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:27,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:27,146 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:27,678 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:14:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:14:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:14:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:14:27,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:14:27,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:27,739 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:14:27,739 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:14:27,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:14:27,740 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:27,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:14:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:14:27,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:27,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:27,813 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:27,813 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:27,814 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:14:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:14:27,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:27,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:27,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:14:27,815 INFO L87 Difference]: Start difference. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:14:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:27,817 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:14:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:14:27,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:27,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:27,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:27,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:14:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-04-28 11:14:27,819 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 80 [2022-04-28 11:14:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:27,819 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-04-28 11:14:27,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:27,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 106 transitions. [2022-04-28 11:14:27,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:14:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:14:27,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:27,934 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:27,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:28,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:28,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 9 times [2022-04-28 11:14:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:28,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624260112] [2022-04-28 11:14:28,410 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:28,410 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 10 times [2022-04-28 11:14:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:28,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911703729] [2022-04-28 11:14:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:28,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:28,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387064796] [2022-04-28 11:14:28,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:28,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:28,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:28,418 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:28,420 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:28,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:28,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:28,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:14:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:28,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:28,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:14:28,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7258#true} is VALID [2022-04-28 11:14:28,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:14:28,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:14:28,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {7258#true} is VALID [2022-04-28 11:14:28,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:14:28,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:28,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:28,761 INFO L272 TraceCheckUtils]: 13: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,761 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:28,761 INFO L272 TraceCheckUtils]: 18: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,762 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:28,762 INFO L272 TraceCheckUtils]: 23: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,763 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:28,763 INFO L272 TraceCheckUtils]: 28: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,764 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:28,764 INFO L272 TraceCheckUtils]: 33: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,765 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:28,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {7296#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,766 INFO L272 TraceCheckUtils]: 40: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,767 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,767 INFO L272 TraceCheckUtils]: 45: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,767 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,768 INFO L272 TraceCheckUtils]: 50: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,768 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,768 INFO L272 TraceCheckUtils]: 55: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,769 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,769 INFO L272 TraceCheckUtils]: 60: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,772 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {7378#(and (= (+ (- 1) main_~x~0) 0) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} assume !false; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,773 INFO L272 TraceCheckUtils]: 67: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,773 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,774 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #62#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,774 INFO L272 TraceCheckUtils]: 72: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,774 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} #64#return; {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:14:28,775 INFO L272 TraceCheckUtils]: 77: Hoare triple {7460#(and (= (+ (- 1) main_~x~0) 7) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:28,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:28,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:14:28,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:14:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:14:28,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:28,987 INFO L290 TraceCheckUtils]: 80: Hoare triple {7259#false} assume !false; {7259#false} is VALID [2022-04-28 11:14:28,988 INFO L290 TraceCheckUtils]: 79: Hoare triple {7501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7259#false} is VALID [2022-04-28 11:14:28,988 INFO L290 TraceCheckUtils]: 78: Hoare triple {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:28,988 INFO L272 TraceCheckUtils]: 77: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:28,989 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:28,989 INFO L290 TraceCheckUtils]: 75: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,989 INFO L272 TraceCheckUtils]: 72: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,989 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7258#true} {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:28,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,989 INFO L272 TraceCheckUtils]: 67: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,990 INFO L290 TraceCheckUtils]: 66: Hoare triple {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:28,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7517#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:14:28,991 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:28,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,992 INFO L272 TraceCheckUtils]: 60: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,992 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:28,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,992 INFO L272 TraceCheckUtils]: 55: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:28,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L272 TraceCheckUtils]: 50: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:28,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,993 INFO L272 TraceCheckUtils]: 45: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,994 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7258#true} {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:28,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,994 INFO L272 TraceCheckUtils]: 40: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:28,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7554#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:14:28,996 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:14:28,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,997 INFO L272 TraceCheckUtils]: 33: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,997 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:14:28,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,997 INFO L272 TraceCheckUtils]: 28: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,998 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:14:28,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,998 INFO L272 TraceCheckUtils]: 23: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,998 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:14:28,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,999 INFO L272 TraceCheckUtils]: 18: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,999 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7258#true} {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:14:28,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:28,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:28,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:28,999 INFO L272 TraceCheckUtils]: 13: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:28,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:14:29,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {7258#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7636#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:14:29,000 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7258#true} {7258#true} #60#return; {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#true} assume !(0 == ~cond); {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {7258#true} ~cond := #in~cond; {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L272 TraceCheckUtils]: 6: Hoare triple {7258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {7258#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {7258#true} call #t~ret5 := main(); {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7258#true} {7258#true} #84#return; {7258#true} is VALID [2022-04-28 11:14:29,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {7258#true} assume true; {7258#true} is VALID [2022-04-28 11:14:29,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {7258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7258#true} is VALID [2022-04-28 11:14:29,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {7258#true} call ULTIMATE.init(); {7258#true} is VALID [2022-04-28 11:14:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:14:29,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:29,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911703729] [2022-04-28 11:14:29,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:29,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387064796] [2022-04-28 11:14:29,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387064796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:29,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:29,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:14:29,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:29,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624260112] [2022-04-28 11:14:29,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624260112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:29,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:29,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:14:29,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257345167] [2022-04-28 11:14:29,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:14:29,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:29,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:29,026 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:29,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:14:29,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:29,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:14:29,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:14:29,028 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:29,924 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 11:14:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:14:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:14:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:14:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:14:29,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-04-28 11:14:29,995 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:14:29,996 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:14:29,996 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:14:29,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:14:29,997 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:29,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 222 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:14:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:14:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-04-28 11:14:30,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:30,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:30,043 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:30,044 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:30,047 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:14:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:14:30,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:30,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:30,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:14:30,047 INFO L87 Difference]: Start difference. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:14:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:30,049 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:14:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:14:30,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:30,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:30,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:30,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:14:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:14:30,051 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 81 [2022-04-28 11:14:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:30,053 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:14:30,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:14:30,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:14:30,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:14:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:14:30,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:30,159 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:30,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:30,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:14:30,375 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:30,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 11 times [2022-04-28 11:14:30,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:30,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100035800] [2022-04-28 11:14:30,561 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:30,561 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 12 times [2022-04-28 11:14:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:30,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736261661] [2022-04-28 11:14:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:30,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:30,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807964905] [2022-04-28 11:14:30,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:14:30,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:30,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:30,570 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:14:30,587 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:14:30,630 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:14:30,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:30,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:14:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:30,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:31,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:14:31,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:14:31,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,009 INFO L272 TraceCheckUtils]: 13: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,010 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,010 INFO L272 TraceCheckUtils]: 18: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,010 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,010 INFO L272 TraceCheckUtils]: 23: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,011 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,011 INFO L272 TraceCheckUtils]: 28: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,012 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,012 INFO L272 TraceCheckUtils]: 33: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,013 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:31,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {8439#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:31,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:31,014 INFO L272 TraceCheckUtils]: 40: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,015 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:31,015 INFO L272 TraceCheckUtils]: 45: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,015 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:31,015 INFO L272 TraceCheckUtils]: 50: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,016 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:31,016 INFO L272 TraceCheckUtils]: 55: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,017 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:31,017 INFO L272 TraceCheckUtils]: 60: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:31,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {8591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,018 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:31,019 INFO L290 TraceCheckUtils]: 65: Hoare triple {8521#(and (= (+ (- 1) main_~x~0) 0) (= (+ 5 main_~y~0) main_~z~0) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} assume !false; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,019 INFO L272 TraceCheckUtils]: 67: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,020 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #62#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,020 INFO L272 TraceCheckUtils]: 72: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,021 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #64#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,021 INFO L272 TraceCheckUtils]: 77: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,021 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,021 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,021 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,021 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} #66#return; {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} is VALID [2022-04-28 11:14:31,022 INFO L272 TraceCheckUtils]: 82: Hoare triple {8605#(and (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) (+ main_~z~0 main_~x~0)) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:31,022 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:31,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:14:31,023 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:14:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 11:14:31,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:31,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {8402#false} assume !false; {8402#false} is VALID [2022-04-28 11:14:31,623 INFO L290 TraceCheckUtils]: 84: Hoare triple {8661#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8402#false} is VALID [2022-04-28 11:14:31,624 INFO L290 TraceCheckUtils]: 83: Hoare triple {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8661#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:31,624 INFO L272 TraceCheckUtils]: 82: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8657#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:31,625 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:31,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,625 INFO L272 TraceCheckUtils]: 77: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,626 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:31,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,626 INFO L290 TraceCheckUtils]: 74: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,626 INFO L272 TraceCheckUtils]: 72: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,626 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8401#true} {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:31,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,627 INFO L272 TraceCheckUtils]: 67: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,627 INFO L290 TraceCheckUtils]: 66: Hoare triple {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:31,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {8729#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8677#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:14:31,631 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8729#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-28 11:14:31,631 INFO L290 TraceCheckUtils]: 63: Hoare triple {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:14:31,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {8401#true} ~cond := #in~cond; {8743#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:14:31,632 INFO L272 TraceCheckUtils]: 60: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,632 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:31,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,632 INFO L290 TraceCheckUtils]: 57: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,633 INFO L272 TraceCheckUtils]: 55: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,633 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:31,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,633 INFO L272 TraceCheckUtils]: 50: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,634 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:31,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,634 INFO L272 TraceCheckUtils]: 45: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,635 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:31,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:31,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:31,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:31,635 INFO L272 TraceCheckUtils]: 40: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:31,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,823 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:32,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:32,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:32,823 INFO L272 TraceCheckUtils]: 33: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:32,824 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:32,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:32,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:32,824 INFO L272 TraceCheckUtils]: 28: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:32,824 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:32,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:32,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:32,825 INFO L272 TraceCheckUtils]: 23: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:32,825 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:32,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:32,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:32,825 INFO L272 TraceCheckUtils]: 18: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:32,826 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8401#true} {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:32,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:32,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:32,826 INFO L272 TraceCheckUtils]: 13: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:32,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {8401#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8733#(or (= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:14:32,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8401#true} {8401#true} #60#return; {8401#true} is VALID [2022-04-28 11:14:32,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:32,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {8401#true} assume !(0 == ~cond); {8401#true} is VALID [2022-04-28 11:14:32,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#true} ~cond := #in~cond; {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {8401#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {8401#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {8401#true} call #t~ret5 := main(); {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8401#true} {8401#true} #84#return; {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {8401#true} assume true; {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {8401#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {8401#true} call ULTIMATE.init(); {8401#true} is VALID [2022-04-28 11:14:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-04-28 11:14:32,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:32,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736261661] [2022-04-28 11:14:32,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:32,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807964905] [2022-04-28 11:14:32,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807964905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:14:32,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:14:32,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:14:32,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:32,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100035800] [2022-04-28 11:14:32,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100035800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:32,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:32,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:14:32,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132120069] [2022-04-28 11:14:32,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:14:32,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:32,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:14:32,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:32,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:14:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:14:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:14:32,872 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:14:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:34,008 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 11:14:34,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:14:34,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:14:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:14:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:14:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:14:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:14:34,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-28 11:14:34,095 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:14:34,097 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:14:34,097 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 11:14:34,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:14:34,098 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:34,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 151 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:14:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 11:14:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 11:14:34,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:34,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:34,157 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:34,157 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:34,159 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:14:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:14:34,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:34,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:34,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:14:34,159 INFO L87 Difference]: Start difference. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:14:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:34,161 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:14:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:14:34,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:34,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:34,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:34,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-28 11:14:34,164 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 86 [2022-04-28 11:14:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:34,164 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-28 11:14:34,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:14:34,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-28 11:14:34,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:14:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 11:14:34,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:34,308 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:34,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:34,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:14:34,509 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 3 times [2022-04-28 11:14:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:34,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386317287] [2022-04-28 11:14:34,755 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:34,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 4 times [2022-04-28 11:14:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:34,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287967592] [2022-04-28 11:14:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:34,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:34,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587995680] [2022-04-28 11:14:34,778 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:34,782 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:14:34,800 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:14:34,902 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:34,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:34,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:14:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:34,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:35,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {9609#true} call ULTIMATE.init(); {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {9609#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9609#true} {9609#true} #84#return; {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {9609#true} call #t~ret5 := main(); {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {9609#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {9609#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9609#true} {9609#true} #60#return; {9609#true} is VALID [2022-04-28 11:14:35,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {9609#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:35,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:35,574 INFO L272 TraceCheckUtils]: 13: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,575 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:35,575 INFO L272 TraceCheckUtils]: 18: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,576 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:35,576 INFO L272 TraceCheckUtils]: 23: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,577 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:35,577 INFO L272 TraceCheckUtils]: 28: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,578 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:35,578 INFO L272 TraceCheckUtils]: 33: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,579 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9609#true} {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:35,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {9647#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:35,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !false; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:35,580 INFO L272 TraceCheckUtils]: 40: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,580 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #62#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:35,580 INFO L272 TraceCheckUtils]: 45: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,581 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #64#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:35,581 INFO L272 TraceCheckUtils]: 50: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,582 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #66#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:35,582 INFO L272 TraceCheckUtils]: 55: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,583 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #68#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:35,583 INFO L272 TraceCheckUtils]: 60: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,584 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9609#true} {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} #70#return; {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:35,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {9729#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= 6 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !false; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,585 INFO L272 TraceCheckUtils]: 67: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,585 INFO L290 TraceCheckUtils]: 68: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,585 INFO L290 TraceCheckUtils]: 69: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,586 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #62#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,586 INFO L272 TraceCheckUtils]: 72: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,586 INFO L290 TraceCheckUtils]: 73: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,586 INFO L290 TraceCheckUtils]: 74: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,586 INFO L290 TraceCheckUtils]: 75: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,586 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #64#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,586 INFO L272 TraceCheckUtils]: 77: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,587 INFO L290 TraceCheckUtils]: 78: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,587 INFO L290 TraceCheckUtils]: 79: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,587 INFO L290 TraceCheckUtils]: 80: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,587 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #66#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,587 INFO L272 TraceCheckUtils]: 82: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,588 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #68#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,588 INFO L272 TraceCheckUtils]: 87: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,588 INFO L290 TraceCheckUtils]: 88: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,588 INFO L290 TraceCheckUtils]: 90: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,589 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9609#true} {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} #70#return; {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {9811#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= main_~x~0 8))} assume !(~n~0 <= ~a~0); {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,589 INFO L272 TraceCheckUtils]: 93: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9609#true} is VALID [2022-04-28 11:14:35,590 INFO L290 TraceCheckUtils]: 94: Hoare triple {9609#true} ~cond := #in~cond; {9609#true} is VALID [2022-04-28 11:14:35,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {9609#true} assume !(0 == ~cond); {9609#true} is VALID [2022-04-28 11:14:35,590 INFO L290 TraceCheckUtils]: 96: Hoare triple {9609#true} assume true; {9609#true} is VALID [2022-04-28 11:14:35,590 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {9609#true} {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} #72#return; {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} is VALID [2022-04-28 11:14:35,591 INFO L272 TraceCheckUtils]: 98: Hoare triple {9893#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:35,591 INFO L290 TraceCheckUtils]: 99: Hoare triple {9912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:35,592 INFO L290 TraceCheckUtils]: 100: Hoare triple {9916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9610#false} is VALID [2022-04-28 11:14:35,592 INFO L290 TraceCheckUtils]: 101: Hoare triple {9610#false} assume !false; {9610#false} is VALID [2022-04-28 11:14:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:14:35,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287967592] [2022-04-28 11:14:35,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587995680] [2022-04-28 11:14:35,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587995680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:35,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:35,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:14:35,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:35,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386317287] [2022-04-28 11:14:35,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386317287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:35,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:35,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:14:35,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396340864] [2022-04-28 11:14:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-28 11:14:35,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:35,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:35,986 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:14:35,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:14:35,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:35,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:14:35,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:14:35,987 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:36,711 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 11:14:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:14:36,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 102 [2022-04-28 11:14:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:14:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:14:36,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:14:36,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:36,767 INFO L225 Difference]: With dead ends: 117 [2022-04-28 11:14:36,767 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:14:36,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:14:36,768 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:36,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:14:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:14:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 11:14:36,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:36,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:36,813 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:36,813 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:36,815 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:14:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:14:36,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:36,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:36,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:14:36,816 INFO L87 Difference]: Start difference. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:14:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:36,818 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:14:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:14:36,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:36,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:36,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:36,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:14:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-04-28 11:14:36,820 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 102 [2022-04-28 11:14:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:36,820 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-04-28 11:14:36,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:36,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 128 transitions. [2022-04-28 11:14:36,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:14:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 11:14:36,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:36,929 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:36,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:14:37,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:14:37,162 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 13 times [2022-04-28 11:14:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:37,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2057697912] [2022-04-28 11:14:37,352 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:37,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 14 times [2022-04-28 11:14:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:37,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32556187] [2022-04-28 11:14:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:37,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:37,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101042742] [2022-04-28 11:14:37,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:14:37,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:37,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:37,375 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:14:37,376 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:14:37,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:14:37,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:37,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:14:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:37,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:37,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {10737#true} call ULTIMATE.init(); {10737#true} is VALID [2022-04-28 11:14:37,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {10737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10737#true} is VALID [2022-04-28 11:14:37,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#true} {10737#true} #84#return; {10737#true} is VALID [2022-04-28 11:14:37,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#true} call #t~ret5 := main(); {10737#true} is VALID [2022-04-28 11:14:37,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {10737#true} is VALID [2022-04-28 11:14:37,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#true} ~cond := #in~cond; {10763#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:14:37,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {10763#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10767#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:14:37,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {10767#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10767#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:14:37,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10767#(not (= |assume_abort_if_not_#in~cond| 0))} {10737#true} #60#return; {10774#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {10774#(and (<= main_~a~0 1) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} is VALID [2022-04-28 11:14:37,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} assume !false; {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} is VALID [2022-04-28 11:14:37,879 INFO L272 TraceCheckUtils]: 13: Hoare triple {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,880 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10737#true} {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} #62#return; {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} is VALID [2022-04-28 11:14:37,880 INFO L272 TraceCheckUtils]: 18: Hoare triple {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,881 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10737#true} {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} #64#return; {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} is VALID [2022-04-28 11:14:37,881 INFO L272 TraceCheckUtils]: 23: Hoare triple {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,881 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10737#true} {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} #66#return; {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} is VALID [2022-04-28 11:14:37,882 INFO L272 TraceCheckUtils]: 28: Hoare triple {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,882 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10737#true} {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} #68#return; {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} is VALID [2022-04-28 11:14:37,882 INFO L272 TraceCheckUtils]: 33: Hoare triple {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,883 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10737#true} {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} #70#return; {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} is VALID [2022-04-28 11:14:37,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {10778#(and (<= main_~a~0 1) (<= 0 main_~a~0) (<= 0 main_~n~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} assume !false; {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,884 INFO L272 TraceCheckUtils]: 40: Hoare triple {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,885 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10737#true} {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} #62#return; {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,885 INFO L272 TraceCheckUtils]: 45: Hoare triple {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,885 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10737#true} {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} #64#return; {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,885 INFO L272 TraceCheckUtils]: 50: Hoare triple {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,886 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10737#true} {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} #66#return; {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,886 INFO L272 TraceCheckUtils]: 55: Hoare triple {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 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)); {10737#true} is VALID [2022-04-28 11:14:37,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,887 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10737#true} {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} #68#return; {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,887 INFO L272 TraceCheckUtils]: 60: Hoare triple {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,887 INFO L290 TraceCheckUtils]: 63: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,887 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10737#true} {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} #70#return; {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {10860#(and (<= 1 main_~n~0) (<= main_~a~0 1) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,888 INFO L290 TraceCheckUtils]: 66: Hoare triple {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} assume !false; {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,888 INFO L272 TraceCheckUtils]: 67: Hoare triple {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,888 INFO L290 TraceCheckUtils]: 68: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,890 INFO L290 TraceCheckUtils]: 69: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,890 INFO L290 TraceCheckUtils]: 70: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,890 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10737#true} {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} #62#return; {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,890 INFO L272 TraceCheckUtils]: 72: Hoare triple {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,890 INFO L290 TraceCheckUtils]: 73: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,890 INFO L290 TraceCheckUtils]: 74: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,891 INFO L290 TraceCheckUtils]: 75: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,891 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10737#true} {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} #64#return; {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,891 INFO L272 TraceCheckUtils]: 77: Hoare triple {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,891 INFO L290 TraceCheckUtils]: 78: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,891 INFO L290 TraceCheckUtils]: 79: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,892 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10737#true} {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} #66#return; {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,892 INFO L272 TraceCheckUtils]: 82: Hoare triple {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,892 INFO L290 TraceCheckUtils]: 83: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,892 INFO L290 TraceCheckUtils]: 84: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,892 INFO L290 TraceCheckUtils]: 85: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,893 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10737#true} {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} #68#return; {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,893 INFO L272 TraceCheckUtils]: 87: Hoare triple {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10737#true} is VALID [2022-04-28 11:14:37,893 INFO L290 TraceCheckUtils]: 88: Hoare triple {10737#true} ~cond := #in~cond; {10737#true} is VALID [2022-04-28 11:14:37,893 INFO L290 TraceCheckUtils]: 89: Hoare triple {10737#true} assume !(0 == ~cond); {10737#true} is VALID [2022-04-28 11:14:37,893 INFO L290 TraceCheckUtils]: 90: Hoare triple {10737#true} assume true; {10737#true} is VALID [2022-04-28 11:14:37,893 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10737#true} {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} #70#return; {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:14:37,894 INFO L290 TraceCheckUtils]: 92: Hoare triple {10942#(and (<= main_~a~0 1) (<= 2 main_~n~0) (<= 0 main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L290 TraceCheckUtils]: 93: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L272 TraceCheckUtils]: 94: Hoare triple {10738#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L290 TraceCheckUtils]: 95: Hoare triple {10738#false} ~cond := #in~cond; {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L290 TraceCheckUtils]: 96: Hoare triple {10738#false} assume !(0 == ~cond); {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L290 TraceCheckUtils]: 97: Hoare triple {10738#false} assume true; {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10738#false} {10738#false} #62#return; {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L272 TraceCheckUtils]: 99: Hoare triple {10738#false} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L290 TraceCheckUtils]: 100: Hoare triple {10738#false} ~cond := #in~cond; {10738#false} is VALID [2022-04-28 11:14:37,894 INFO L290 TraceCheckUtils]: 101: Hoare triple {10738#false} assume 0 == ~cond; {10738#false} is VALID [2022-04-28 11:14:37,895 INFO L290 TraceCheckUtils]: 102: Hoare triple {10738#false} assume !false; {10738#false} is VALID [2022-04-28 11:14:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2022-04-28 11:14:37,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:14:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:37,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32556187] [2022-04-28 11:14:37,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:37,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101042742] [2022-04-28 11:14:37,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101042742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:37,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:37,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:14:37,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:37,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2057697912] [2022-04-28 11:14:37,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2057697912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:37,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:37,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:14:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733717169] [2022-04-28 11:14:37,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:37,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:14:37,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:37,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:37,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:37,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:14:37,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:14:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:14:37,938 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:38,441 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-04-28 11:14:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:14:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:14:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:14:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:14:38,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:14:38,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:38,541 INFO L225 Difference]: With dead ends: 125 [2022-04-28 11:14:38,541 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 11:14:38,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:14:38,542 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:38,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 185 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:14:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 11:14:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 11:14:38,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:38,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:38,649 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:38,650 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:38,656 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 11:14:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 11:14:38,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:38,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:38,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-28 11:14:38,659 INFO L87 Difference]: Start difference. First operand has 100 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-28 11:14:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:38,660 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 11:14:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 11:14:38,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:38,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:38,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:38,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:14:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-04-28 11:14:38,662 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 103 [2022-04-28 11:14:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:38,662 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-04-28 11:14:38,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:14:38,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 101 transitions. [2022-04-28 11:14:38,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 11:14:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 11:14:38,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:14:38,771 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:14:38,794 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:14:38,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 11:14:38,972 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:14:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:14:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 3 times [2022-04-28 11:14:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:38,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043995224] [2022-04-28 11:14:39,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:14:39,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:14:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 4 times [2022-04-28 11:14:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:14:39,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140977496] [2022-04-28 11:14:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:14:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:14:39,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:14:39,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749695987] [2022-04-28 11:14:39,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:14:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:14:39,175 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:14:39,207 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:14:39,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:14:39,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:14:39,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:14:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:14:39,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:14:39,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {11705#true} call ULTIMATE.init(); {11705#true} is VALID [2022-04-28 11:14:39,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {11705#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); {11705#true} is VALID [2022-04-28 11:14:39,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11705#true} {11705#true} #84#return; {11705#true} is VALID [2022-04-28 11:14:39,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {11705#true} call #t~ret5 := main(); {11705#true} is VALID [2022-04-28 11:14:39,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {11705#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; {11705#true} is VALID [2022-04-28 11:14:39,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {11705#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11705#true} {11705#true} #60#return; {11705#true} is VALID [2022-04-28 11:14:39,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {11705#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:39,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:39,732 INFO L272 TraceCheckUtils]: 13: Hoare triple {11743#(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)); {11705#true} is VALID [2022-04-28 11:14:39,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,732 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11705#true} {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:39,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {11743#(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)); {11705#true} is VALID [2022-04-28 11:14:39,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,733 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11705#true} {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:39,733 INFO L272 TraceCheckUtils]: 23: Hoare triple {11743#(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)); {11705#true} is VALID [2022-04-28 11:14:39,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,734 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11705#true} {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:39,734 INFO L272 TraceCheckUtils]: 28: Hoare triple {11743#(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)); {11705#true} is VALID [2022-04-28 11:14:39,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,734 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11705#true} {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:39,734 INFO L272 TraceCheckUtils]: 33: Hoare triple {11743#(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)); {11705#true} is VALID [2022-04-28 11:14:39,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,735 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11705#true} {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {11743#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:14:39,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {11743#(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; {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:39,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !false; {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:39,736 INFO L272 TraceCheckUtils]: 40: Hoare triple {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,736 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11705#true} {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #62#return; {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:39,736 INFO L272 TraceCheckUtils]: 45: Hoare triple {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,737 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {11705#true} {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #64#return; {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:39,737 INFO L272 TraceCheckUtils]: 50: Hoare triple {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,737 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11705#true} {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #66#return; {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:39,738 INFO L272 TraceCheckUtils]: 55: Hoare triple {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,738 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11705#true} {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #68#return; {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:39,738 INFO L272 TraceCheckUtils]: 60: Hoare triple {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,738 INFO L290 TraceCheckUtils]: 63: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,739 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11705#true} {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #70#return; {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:14:39,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {11825#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} assume !false; {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,740 INFO L272 TraceCheckUtils]: 67: Hoare triple {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,740 INFO L290 TraceCheckUtils]: 68: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,740 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11705#true} {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #62#return; {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,740 INFO L272 TraceCheckUtils]: 72: Hoare triple {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,741 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11705#true} {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #64#return; {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,741 INFO L272 TraceCheckUtils]: 77: Hoare triple {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,741 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {11705#true} {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #66#return; {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,742 INFO L272 TraceCheckUtils]: 82: Hoare triple {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,742 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11705#true} {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #68#return; {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,742 INFO L272 TraceCheckUtils]: 87: Hoare triple {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,742 INFO L290 TraceCheckUtils]: 90: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,743 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11705#true} {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #70#return; {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,743 INFO L290 TraceCheckUtils]: 92: Hoare triple {11907#(and (<= main_~n~0 2) (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} assume !(~n~0 <= ~a~0); {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,743 INFO L272 TraceCheckUtils]: 93: Hoare triple {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,743 INFO L290 TraceCheckUtils]: 94: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,744 INFO L290 TraceCheckUtils]: 95: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,744 INFO L290 TraceCheckUtils]: 96: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,744 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11705#true} {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} #72#return; {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,744 INFO L272 TraceCheckUtils]: 98: Hoare triple {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {11705#true} is VALID [2022-04-28 11:14:39,744 INFO L290 TraceCheckUtils]: 99: Hoare triple {11705#true} ~cond := #in~cond; {11705#true} is VALID [2022-04-28 11:14:39,744 INFO L290 TraceCheckUtils]: 100: Hoare triple {11705#true} assume !(0 == ~cond); {11705#true} is VALID [2022-04-28 11:14:39,744 INFO L290 TraceCheckUtils]: 101: Hoare triple {11705#true} assume true; {11705#true} is VALID [2022-04-28 11:14:39,745 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11705#true} {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} #74#return; {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:14:39,745 INFO L272 TraceCheckUtils]: 103: Hoare triple {11989#(and (<= 1 main_~a~0) (= main_~z~0 (+ (- 1) main_~y~0)) (< main_~a~0 2) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {12023#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:14:39,746 INFO L290 TraceCheckUtils]: 104: Hoare triple {12023#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12027#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:14:39,746 INFO L290 TraceCheckUtils]: 105: Hoare triple {12027#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11706#false} is VALID [2022-04-28 11:14:39,746 INFO L290 TraceCheckUtils]: 106: Hoare triple {11706#false} assume !false; {11706#false} is VALID [2022-04-28 11:14:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:14:39,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:14:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:14:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140977496] [2022-04-28 11:14:40,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:14:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749695987] [2022-04-28 11:14:40,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749695987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:14:40,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:14:40,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:14:40,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:14:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043995224] [2022-04-28 11:14:40,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043995224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:14:40,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:14:40,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:14:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97729082] [2022-04-28 11:14:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:14:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:14:40,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:14:40,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:14:40,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:40,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:14:40,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:14:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:14:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:14:40,894 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:14:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:41,420 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-04-28 11:14:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:14:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:14:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:14:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:14:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-28 11:14:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:14:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-28 11:14:41,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-28 11:14:41,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:41,476 INFO L225 Difference]: With dead ends: 104 [2022-04-28 11:14:41,476 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:14:41,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:14:41,477 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:14:41,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 145 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:14:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:14:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:14:41,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:14:41,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:14:41,477 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:14:41,477 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:14:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:41,478 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:14:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:14:41,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:41,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:41,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:14:41,478 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:14:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:14:41,478 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:14:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:14:41,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:41,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:14:41,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:14:41,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:14:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:14:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:14:41,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2022-04-28 11:14:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:14:41,479 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:14:41,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:14:41,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:14:41,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:14:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:14:41,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:14:41,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:14:41,517 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:14:41,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:14:41,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:14:43,247 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:14:43,248 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:14:43,248 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:14:43,248 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse0 (<= main_~a~0 1)) (.cse2 (<= 0 main_~a~0))) (or (and .cse0 (<= 1 main_~a~0) .cse1 (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) .cse0 (= main_~y~0 1) .cse1 .cse2 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse2 (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) (= main_~z~0 6)) (and (<= main_~a~0 1) (= main_~n~0 2) (<= 1 main_~a~0) (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (= main_~n~0 1) (< main_~a~0 1) (= main_~y~0 (+ main_~x~0 6)))) [2022-04-28 11:14:43,248 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 56) the Hoare annotation is: true [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= main_~n~0 2) (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= main_~n~0 2) (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:14:43,248 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) (= main_~z~0 6)) (and (<= main_~a~0 1) (= main_~n~0 2) (<= 1 main_~a~0) (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (= main_~n~0 1) (< main_~a~0 1) (= main_~y~0 (+ main_~x~0 6)))) [2022-04-28 11:14:43,248 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 56) the Hoare annotation is: true [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L38(lines 33 46) the Hoare annotation is: (let ((.cse0 (<= main_~a~0 1)) (.cse1 (<= 0 main_~a~0))) (or (and .cse0 (= main_~n~0 2) (<= 1 main_~a~0) (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) .cse0 (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) .cse1 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse1 (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (<= main_~a~0 1)) (.cse1 (<= 0 main_~a~0))) (or (and .cse0 (= main_~n~0 2) (<= 1 main_~a~0) (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) .cse0 (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) .cse1 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse1 (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse0 (<= main_~a~0 1)) (.cse2 (<= 0 main_~a~0))) (or (and .cse0 (<= 1 main_~a~0) .cse1 (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) .cse0 (= main_~y~0 1) .cse1 .cse2 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse2 (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse0 (<= main_~a~0 1)) (.cse2 (<= 0 main_~a~0))) (or (and .cse0 (<= 1 main_~a~0) .cse1 (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) .cse0 (= main_~y~0 1) .cse1 .cse2 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse2 (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:14:43,249 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-28 11:14:43,249 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= main_~a~0 1) (<= 0 main_~a~0)) [2022-04-28 11:14:43,249 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse1 (+ main_~z~0 main_~x~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) .cse1) (= main_~y~0 (+ main_~x~0 6))) (and (= main_~n~0 2) (= (+ main_~x~0 10) main_~z~0) (= (+ 7 main_~y~0) .cse1) (= main_~x~0 8)))) [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and (<= main_~a~0 1) (<= 1 main_~a~0) .cse0 (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (<= 0 main_~a~0) (= main_~n~0 1) (< main_~a~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (<= main_~a~0 1)) (.cse1 (<= 0 main_~a~0))) (or (and .cse0 (= main_~n~0 2) (<= 1 main_~a~0) (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) .cse0 (= main_~y~0 1) (= (+ (* main_~n~0 6) 6) main_~z~0) .cse1 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) .cse1 (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6))))) [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (<= main_~a~0 1)) (.cse1 (= (+ (* main_~n~0 6) 6) main_~z~0)) (.cse2 (<= 0 main_~a~0))) (or (and .cse0 .cse1 (= main_~x~0 1) .cse2 (= main_~n~0 1) (= main_~y~0 (+ main_~x~0 6))) (and .cse0 (= main_~n~0 2) (<= 1 main_~a~0) (= 19 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (= main_~x~0 8)) (and (= main_~x~0 0) .cse0 (= main_~y~0 1) .cse1 .cse2 (= main_~z~0 6)))) [2022-04-28 11:14:43,249 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:14:43,249 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:14:43,249 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:14:43,250 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:14:43,250 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:14:43,250 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:14:43,250 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:14:43,250 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:14:43,250 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 11:14:43,250 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:14:43,250 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 11:14:43,250 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-28 11:14:43,250 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:14:43,252 INFO L356 BasicCegarLoop]: Path program histogram: [14, 4, 4, 2, 2, 2, 2, 2] [2022-04-28 11:14:43,253 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:14:43,255 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:14:43,256 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:14:43,273 INFO L163 areAnnotationChecker]: CFG has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:14:43,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:14:43 BoogieIcfgContainer [2022-04-28 11:14:43,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:14:43,302 INFO L158 Benchmark]: Toolchain (without parser) took 34152.21ms. Allocated memory was 191.9MB in the beginning and 425.7MB in the end (delta: 233.8MB). Free memory was 139.8MB in the beginning and 314.4MB in the end (delta: -174.6MB). Peak memory consumption was 226.6MB. Max. memory is 8.0GB. [2022-04-28 11:14:43,302 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 191.9MB. Free memory was 155.7MB in the beginning and 155.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:14:43,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.72ms. Allocated memory is still 191.9MB. Free memory was 139.5MB in the beginning and 163.4MB in the end (delta: -23.9MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-28 11:14:43,302 INFO L158 Benchmark]: Boogie Preprocessor took 22.42ms. Allocated memory is still 191.9MB. Free memory was 163.4MB in the beginning and 161.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:14:43,303 INFO L158 Benchmark]: RCFGBuilder took 293.02ms. Allocated memory is still 191.9MB. Free memory was 161.9MB in the beginning and 149.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:14:43,303 INFO L158 Benchmark]: TraceAbstraction took 33571.19ms. Allocated memory was 191.9MB in the beginning and 425.7MB in the end (delta: 233.8MB). Free memory was 149.3MB in the beginning and 314.4MB in the end (delta: -165.1MB). Peak memory consumption was 236.5MB. Max. memory is 8.0GB. [2022-04-28 11:14:43,303 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.14ms. Allocated memory is still 191.9MB. Free memory was 155.7MB in the beginning and 155.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.72ms. Allocated memory is still 191.9MB. Free memory was 139.5MB in the beginning and 163.4MB in the end (delta: -23.9MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.42ms. Allocated memory is still 191.9MB. Free memory was 163.4MB in the beginning and 161.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 293.02ms. Allocated memory is still 191.9MB. Free memory was 161.9MB in the beginning and 149.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 33571.19ms. Allocated memory was 191.9MB in the beginning and 425.7MB in the end (delta: 233.8MB). Free memory was 149.3MB in the beginning and 314.4MB in the end (delta: -165.1MB). Peak memory consumption was 236.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 16, TraceHistogramMax: 18, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 2536 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1775 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2515 IncrementalHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 761 mSDtfsCounter, 2515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1546 GetRequests, 1406 SyntacticMatches, 12 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=14, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 360 PreInvPairs, 497 NumberOfFragments, 951 HoareAnnotationTreeSize, 360 FomulaSimplifications, 928 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 36 FomulaSimplificationsInter, 8739 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((a <= 1 && 1 <= a) && n * 6 + 6 == z) && 19 == y) && y == z + 1) && x == 8) || (((((x == 0 && a <= 1) && y == 1) && n * 6 + 6 == z) && 0 <= a) && z == 6)) || (((((a <= 1 && x == 1) && y + 6 == z + x) && 0 <= a) && n == 1) && y == x + 6) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || \old(cond) == 0 RESULT: Ultimate proved your program to be correct! [2022-04-28 11:14:43,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...