/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:56:49,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:56:49,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:56:49,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:56:49,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:56:49,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:56:49,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:56:49,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:56:49,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:56:49,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:56:49,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:56:49,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:56:49,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:56:49,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:56:49,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:56:49,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:56:49,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:56:49,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:56:49,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:56:49,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:56:49,155 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:56:49,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:56:49,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:56:49,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:56:49,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:56:49,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:56:49,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:56:49,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:56:49,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:56:49,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:56:49,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:56:49,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:56:49,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:56:49,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:56:49,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:56:49,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:56:49,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:56:49,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:56:49,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:56:49,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:56:49,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:56:49,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:56:49,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:56:49,191 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:56:49,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:56:49,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:56:49,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:56:49,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:56:49,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:56:49,192 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:56:49,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:56:49,192 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:56:49,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:56:49,193 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:56:49,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:56:49,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:56:49,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:56:49,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:56:49,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:56:49,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:56:49,194 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:56:49,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:56:49,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:56:49,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:56:49,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:56:49,196 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:56:49,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:56:49,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:56:49,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 12:56:49,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:56:49,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:56:49,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:56:49,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:56:49,399 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:56:49,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-07 12:56:49,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca348a5c/9fc8d0bc5e5f458da8cac6cee5464994/FLAG1ff758bdd [2022-04-07 12:56:49,799 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:56:49,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-04-07 12:56:49,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca348a5c/9fc8d0bc5e5f458da8cac6cee5464994/FLAG1ff758bdd [2022-04-07 12:56:49,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca348a5c/9fc8d0bc5e5f458da8cac6cee5464994 [2022-04-07 12:56:49,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:56:49,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:56:49,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:56:49,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:56:49,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:56:49,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:56:49" (1/1) ... [2022-04-07 12:56:49,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eeb3577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:49, skipping insertion in model container [2022-04-07 12:56:49,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:56:49" (1/1) ... [2022-04-07 12:56:49,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:56:49,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:56:49,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-04-07 12:56:50,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:56:50,024 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:56:50,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-04-07 12:56:50,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:56:50,072 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:56:50,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50 WrapperNode [2022-04-07 12:56:50,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:56:50,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:56:50,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:56:50,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:56:50,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:56:50,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:56:50,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:56:50,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:56:50,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (1/1) ... [2022-04-07 12:56:50,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:56:50,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:50,146 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-07 12:56:50,164 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-07 12:56:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:56:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:56:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:56:50,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:56:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:56:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:56:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:56:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:56:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:56:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:56:50,233 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:56:50,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:56:50,379 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:56:50,384 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:56:50,384 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:56:50,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:56:50 BoogieIcfgContainer [2022-04-07 12:56:50,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:56:50,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:56:50,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:56:50,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:56:50,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:56:49" (1/3) ... [2022-04-07 12:56:50,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb7fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:56:50, skipping insertion in model container [2022-04-07 12:56:50,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:50" (2/3) ... [2022-04-07 12:56:50,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb7fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:56:50, skipping insertion in model container [2022-04-07 12:56:50,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:56:50" (3/3) ... [2022-04-07 12:56:50,395 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound5.c [2022-04-07 12:56:50,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:56:50,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:56:50,433 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:56:50,437 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 12:56:50,437 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:56:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:56:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:56:50,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:50,454 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:50,454 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-07 12:56:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:50,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287883632] [2022-04-07 12:56:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:56:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:50,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-07 12:56:50,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:56:50,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:56:50,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:56:50,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-07 12:56:50,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:56:50,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:56:50,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-07 12:56:50,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-07 12:56:50,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-07 12:56:50,622 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-07 12:56:50,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-07 12:56:50,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-07 12:56:50,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-07 12:56:50,623 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-07 12:56:50,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:50,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287883632] [2022-04-07 12:56:50,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287883632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:50,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:50,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:56:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514061052] [2022-04-07 12:56:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:50,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 12:56:50,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:50,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:50,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:50,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:56:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:56:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:56:50,677 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:50,876 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-07 12:56:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:56:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 12:56:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:56:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:56:50,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-07 12:56:51,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:51,022 INFO L225 Difference]: With dead ends: 57 [2022-04-07 12:56:51,023 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 12:56:51,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:56:51,029 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:51,029 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:56:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 12:56:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 12:56:51,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:51,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,068 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,068 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:51,072 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:56:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:56:51,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:51,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:51,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 12:56:51,076 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 12:56:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:51,079 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:56:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:56:51,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:51,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:51,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:51,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-07 12:56:51,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-07 12:56:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:51,083 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-07 12:56:51,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-07 12:56:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:56:51,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:51,086 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:51,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:56:51,086 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-07 12:56:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:51,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950419725] [2022-04-07 12:56:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:56:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:51,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:56:51,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:51,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {233#(= |main_#t~post5| 0)} is VALID [2022-04-07 12:56:51,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {228#false} is VALID [2022-04-07 12:56:51,178 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {228#false} is VALID [2022-04-07 12:56:51,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-07 12:56:51,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-07 12:56:51,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-07 12:56:51,180 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-07 12:56:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:51,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950419725] [2022-04-07 12:56:51,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950419725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:51,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:51,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:56:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703678670] [2022-04-07 12:56:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:51,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:56:51,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:51,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:51,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:51,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:51,194 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:51,449 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 12:56:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:56:51,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:56:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:56:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:56:51,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-07 12:56:51,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:51,514 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:56:51,514 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 12:56:51,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:56:51,518 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:51,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:56:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 12:56:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 12:56:51,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:51,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,523 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,523 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:51,525 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:56:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:56:51,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:51,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:51,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 12:56:51,526 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 12:56:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:51,528 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:56:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:56:51,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:51,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:51,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:51,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-07 12:56:51,531 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-07 12:56:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:51,531 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-07 12:56:51,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:56:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:56:51,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:51,531 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:51,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:56:51,532 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-07 12:56:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:51,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674053787] [2022-04-07 12:56:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:56:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:51,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-07 12:56:51,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:56:51,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:56:51,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:56:51,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-07 12:56:51,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:56:51,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:56:51,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-07 12:56:51,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:56:51,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:56:51,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 5);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:56:51,626 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:56:51,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:56:51,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-07 12:56:51,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-07 12:56:51,627 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-07 12:56:51,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:51,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674053787] [2022-04-07 12:56:51,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674053787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:51,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:51,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:56:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921498437] [2022-04-07 12:56:51,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:51,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:56:51,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:51,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:51,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:56:51,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:56:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:56:51,638 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:51,957 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-07 12:56:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:56:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:56:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:56:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:56:51,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-07 12:56:52,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:52,001 INFO L225 Difference]: With dead ends: 34 [2022-04-07 12:56:52,001 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 12:56:52,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:56:52,002 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:52,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:56:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 12:56:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 12:56:52,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:52,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:52,008 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:52,008 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:52,010 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:56:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:56:52,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:52,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:52,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 12:56:52,011 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 12:56:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:52,012 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:56:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:56:52,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:52,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:52,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:52,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:56:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 12:56:52,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-07 12:56:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:52,015 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 12:56:52,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:56:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:56:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:56:52,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:52,016 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:52,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 12:56:52,016 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-07 12:56:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:52,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680314829] [2022-04-07 12:56:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:52,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:52,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197307514] [2022-04-07 12:56:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:52,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:52,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:52,038 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-07 12:56:52,039 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-07 12:56:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:52,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:56:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:52,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:52,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-07 12:56:52,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {593#true} is VALID [2022-04-07 12:56:52,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:56:52,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-07 12:56:52,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-07 12:56:52,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:52,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:52,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:52,221 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {593#true} is VALID [2022-04-07 12:56:52,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-07 12:56:52,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-07 12:56:52,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:56:52,222 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:52,223 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:52,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:52,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-07 12:56:52,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-07 12:56:52,224 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-07 12:56:52,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:56:52,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:52,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680314829] [2022-04-07 12:56:52,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:52,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197307514] [2022-04-07 12:56:52,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197307514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:52,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:52,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:56:52,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041832885] [2022-04-07 12:56:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:52,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 12:56:52,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:52,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:56:52,260 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-07 12:56:52,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:52,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:52,261 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:56:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:52,551 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-07 12:56:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:56:52,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 12:56:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:56:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:56:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:52,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:56:52,696 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-07 12:56:52,697 INFO L225 Difference]: With dead ends: 50 [2022-04-07 12:56:52,697 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 12:56:52,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:56:52,698 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:52,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:56:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 12:56:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-07 12:56:52,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:52,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:56:52,725 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:56:52,725 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:56:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:52,728 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:56:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:56:52,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:52,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:52,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 12:56:52,729 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 12:56:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:52,732 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:56:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:56:52,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:52,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:52,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:52,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:56:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-07 12:56:52,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-07 12:56:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:52,734 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-07 12:56:52,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:56:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 12:56:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 12:56:52,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:52,740 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:52,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:56:52,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:52,959 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-07 12:56:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:52,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558578117] [2022-04-07 12:56:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:52,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:52,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204631115] [2022-04-07 12:56:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:52,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:52,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:52,990 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-07 12:56:52,991 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-07 12:56:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:53,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:56:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:53,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:53,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-07 12:56:53,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {887#true} is VALID [2022-04-07 12:56:53,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:56:53,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-07 12:56:53,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-07 12:56:53,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:56:53,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:56:53,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:56:53,127 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {887#true} is VALID [2022-04-07 12:56:53,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:56:53,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:56:53,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:56:53,128 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:56:53,128 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {887#true} is VALID [2022-04-07 12:56:53,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:56:53,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:56:53,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:56:53,129 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:56:53,129 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:53,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:53,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-07 12:56:53,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-07 12:56:53,130 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-07 12:56:53,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:56:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558578117] [2022-04-07 12:56:53,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204631115] [2022-04-07 12:56:53,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204631115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:53,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:53,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:56:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621436891] [2022-04-07 12:56:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 12:56:53,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:53,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:56:53,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:53,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:53,145 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:56:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:53,342 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-07 12:56:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:56:53,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 12:56:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:56:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:56:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:53,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:56:53,397 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-07 12:56:53,399 INFO L225 Difference]: With dead ends: 54 [2022-04-07 12:56:53,399 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 12:56:53,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:56:53,400 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:53,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:56:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 12:56:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-07 12:56:53,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:53,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:56:53,420 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:56:53,420 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:56:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:53,423 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:56:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:56:53,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:53,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:53,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 12:56:53,424 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 12:56:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:53,426 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:56:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:56:53,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:53,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:53,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:53,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 12:56:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-07 12:56:53,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-07 12:56:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:53,430 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-07 12:56:53,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:56:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-07 12:56:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 12:56:53,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:53,431 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:53,449 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-07 12:56:53,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:53,632 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-07 12:56:53,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:53,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943385429] [2022-04-07 12:56:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:53,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:53,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:53,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393711366] [2022-04-07 12:56:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:53,668 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-07 12:56:53,669 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-07 12:56:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:53,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 12:56:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:53,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:53,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-07 12:56:53,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1225#true} is VALID [2022-04-07 12:56:53,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:53,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-07 12:56:53,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-07 12:56:53,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:53,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:53,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:53,855 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-07 12:56:53,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:56:53,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:56:53,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:53,857 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:53,857 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1225#true} is VALID [2022-04-07 12:56:53,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:56:53,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:56:53,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:53,858 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:53,858 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-07 12:56:53,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:56:53,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:56:53,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:53,861 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:53,862 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:53,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:53,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-07 12:56:53,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-07 12:56:53,864 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-07 12:56:53,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:56:53,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:53,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943385429] [2022-04-07 12:56:53,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:53,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393711366] [2022-04-07 12:56:53,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393711366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:53,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:53,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:56:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622408203] [2022-04-07 12:56:53,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:53,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 12:56:53,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:53,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:56:53,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:53,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:53,886 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:56:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:54,188 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-07 12:56:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:56:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 12:56:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:56:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:56:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:54,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:56:54,248 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-07 12:56:54,249 INFO L225 Difference]: With dead ends: 62 [2022-04-07 12:56:54,249 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 12:56:54,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:56:54,250 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:54,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:56:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 12:56:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 12:56:54,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:54,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:56:54,258 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:56:54,258 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:56:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:54,260 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:56:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:56:54,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:54,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:54,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 12:56:54,261 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 12:56:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:54,262 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:56:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:56:54,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:54,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:54,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:54,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:56:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-07 12:56:54,265 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-07 12:56:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:54,265 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-07 12:56:54,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:56:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:56:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:56:54,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:54,266 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:54,285 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-07 12:56:54,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:54,480 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-07 12:56:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119730875] [2022-04-07 12:56:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:54,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:54,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57118945] [2022-04-07 12:56:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:54,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:54,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:54,496 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-07 12:56:54,501 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-07 12:56:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:54,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:56:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:54,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:54,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:56:54,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:54,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:54,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:54,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:54,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:54,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,740 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,751 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,752 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,753 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,753 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,754 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,755 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,756 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,756 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,758 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:54,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-07 12:56:54,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:56:54,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:56:54,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:56:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-07 12:56:54,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:54,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:56:54,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:56:54,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:56:54,935 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-07 12:56:54,935 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:56:54,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:54,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:54,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:54,935 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:54,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:56:54,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 5)} is VALID [2022-04-07 12:56:54,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,936 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #67#return; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:54,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:54,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:54,937 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:54,937 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #65#return; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:54,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:54,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:54,937 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:54,938 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #63#return; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:54,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:54,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:54,938 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:54,939 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #61#return; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:54,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:54,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:54,939 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:54,939 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 5)} #59#return; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:54,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:54,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:54,940 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:54,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 5)} is VALID [2022-04-07 12:56:54,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 4)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1841#(< ~counter~0 4)} is VALID [2022-04-07 12:56:54,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 4)} call #t~ret6 := main(); {1841#(< ~counter~0 4)} is VALID [2022-04-07 12:56:54,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 4)} {1585#true} #81#return; {1841#(< ~counter~0 4)} is VALID [2022-04-07 12:56:54,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 4)} assume true; {1841#(< ~counter~0 4)} is VALID [2022-04-07 12:56:54,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1841#(< ~counter~0 4)} is VALID [2022-04-07 12:56:54,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:56:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:56:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:54,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119730875] [2022-04-07 12:56:54,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:54,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57118945] [2022-04-07 12:56:54,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57118945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:54,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:54,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 12:56:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908388436] [2022-04-07 12:56:54,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:54,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-07 12:56:54,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:54,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:56:54,980 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-07 12:56:54,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:54,981 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:56:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:55,520 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-07 12:56:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:56:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-07 12:56:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:56:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:56:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:56:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:56:55,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-07 12:56:55,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:55,640 INFO L225 Difference]: With dead ends: 120 [2022-04-07 12:56:55,640 INFO L226 Difference]: Without dead ends: 104 [2022-04-07 12:56:55,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:56:55,641 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:55,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 194 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:56:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-07 12:56:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-07 12:56:55,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:55,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:55,672 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:55,673 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:55,676 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:56:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:56:55,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:55,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:55,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-07 12:56:55,677 INFO L87 Difference]: Start difference. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-07 12:56:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:55,681 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:56:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:56:55,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:55,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:55,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:55,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-07 12:56:55,685 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-07 12:56:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:55,685 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-07 12:56:55,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-07 12:56:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-07 12:56:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:56:55,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:55,686 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:55,705 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-07 12:56:55,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:55,899 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-07 12:56:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:55,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333224541] [2022-04-07 12:56:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:55,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:55,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11333325] [2022-04-07 12:56:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:55,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:55,911 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-07 12:56:55,912 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-07 12:56:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:55,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:56:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:55,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:56,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:56:56,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-07 12:56:56,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:56:56,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:56:56,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,152 INFO L272 TraceCheckUtils]: 8: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,152 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,152 INFO L272 TraceCheckUtils]: 13: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,153 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,153 INFO L272 TraceCheckUtils]: 18: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,154 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,154 INFO L272 TraceCheckUtils]: 23: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,154 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,154 INFO L272 TraceCheckUtils]: 28: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,155 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:56,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:56:56,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:56:56,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:56:56,156 INFO L272 TraceCheckUtils]: 36: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,164 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:56:56,164 INFO L272 TraceCheckUtils]: 41: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:56,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:56,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:56:56,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:56:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:56:56,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:56,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:56:56,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:56:56,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:56,345 INFO L272 TraceCheckUtils]: 41: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:56,345 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:56:56,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,345 INFO L272 TraceCheckUtils]: 36: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 5);havoc #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:56:56,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:56:56,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:56:56,352 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #67#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,353 INFO L272 TraceCheckUtils]: 28: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,353 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #65#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,353 INFO L272 TraceCheckUtils]: 23: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,354 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #63#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,354 INFO L272 TraceCheckUtils]: 18: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,355 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #61#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,355 INFO L272 TraceCheckUtils]: 13: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,355 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #59#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:56,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:56,356 INFO L272 TraceCheckUtils]: 8: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-07 12:56:56,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 12:56:56,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:56:56,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:56:56,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:56,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-07 12:56:56,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:56:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 12:56:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:56,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333224541] [2022-04-07 12:56:56,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:56,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11333325] [2022-04-07 12:56:56,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11333325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:56,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:56,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:56:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350201722] [2022-04-07 12:56:56,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-07 12:56:56,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:56,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:56:56,401 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-07 12:56:56,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:56,402 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:56:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:57,104 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-07 12:56:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:56:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-07 12:56:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:56:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:56:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:56:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:56:57,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:56:57,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:57,222 INFO L225 Difference]: With dead ends: 118 [2022-04-07 12:56:57,222 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 12:56:57,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:56:57,223 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:57,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:56:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 12:56:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-07 12:56:57,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:57,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:57,269 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:57,269 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:57,272 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:56:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:56:57,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:57,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:57,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-07 12:56:57,273 INFO L87 Difference]: Start difference. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-07 12:56:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:57,278 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:56:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:56:57,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:57,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:57,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:57,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-07 12:56:57,282 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-07 12:56:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:57,283 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-07 12:56:57,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 12:56:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:56:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 12:56:57,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:57,284 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:57,309 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-07 12:56:57,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:57,501 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:57,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-07 12:56:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:57,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089421741] [2022-04-07 12:56:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:57,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579414349] [2022-04-07 12:56:57,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:56:57,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:57,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:57,543 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-07 12:56:57,544 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-07 12:56:57,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:56:57,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:56:57,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:56:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:57,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:57,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:56:57,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-07 12:56:57,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:56:57,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:56:57,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,764 INFO L272 TraceCheckUtils]: 8: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,764 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #59#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,765 INFO L272 TraceCheckUtils]: 13: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,765 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #61#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,765 INFO L272 TraceCheckUtils]: 18: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,766 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #63#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,766 INFO L272 TraceCheckUtils]: 23: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,767 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #65#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,767 INFO L272 TraceCheckUtils]: 28: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,768 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #67#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:57,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:56:57,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:56:57,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:56:57,769 INFO L272 TraceCheckUtils]: 36: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,770 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #59#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:56:57,770 INFO L272 TraceCheckUtils]: 41: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,771 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #61#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:56:57,771 INFO L272 TraceCheckUtils]: 46: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:57,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:57,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:56:57,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:56:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 12:56:57,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:57,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:56:57,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:56:57,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:57,929 INFO L272 TraceCheckUtils]: 46: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:57,929 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #61#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:56:57,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,929 INFO L272 TraceCheckUtils]: 41: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,930 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #59#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:56:57,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,930 INFO L272 TraceCheckUtils]: 36: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 5);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:56:57,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:56:57,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:56:57,933 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #67#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,933 INFO L272 TraceCheckUtils]: 28: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,934 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #65#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,934 INFO L272 TraceCheckUtils]: 23: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,934 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #63#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,935 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,936 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #61#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,940 INFO L272 TraceCheckUtils]: 13: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,941 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #59#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:57,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:57,941 INFO L272 TraceCheckUtils]: 8: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-07 12:56:57,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 12:56:57,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:56:57,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:56:57,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:57,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-07 12:56:57,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:56:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 12:56:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:57,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089421741] [2022-04-07 12:56:57,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:57,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579414349] [2022-04-07 12:56:57,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579414349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:57,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:57,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:56:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781161060] [2022-04-07 12:56:57,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:57,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-07 12:56:57,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:57,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:56:57,995 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-07 12:56:57,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:57,995 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:56:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:58,505 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-07 12:56:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:56:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-07 12:56:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:56:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:56:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:56:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:56:58,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-07 12:56:58,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:58,589 INFO L225 Difference]: With dead ends: 122 [2022-04-07 12:56:58,589 INFO L226 Difference]: Without dead ends: 120 [2022-04-07 12:56:58,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:56:58,590 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:58,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:56:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-07 12:56:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-07 12:56:58,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:58,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:58,632 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:58,632 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:58,640 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:56:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:56:58,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:58,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:58,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-07 12:56:58,641 INFO L87 Difference]: Start difference. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-07 12:56:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:58,643 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:56:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:56:58,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:58,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:58,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:58,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-07 12:56:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-07 12:56:58,646 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-07 12:56:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:58,647 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-07 12:56:58,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 12:56:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:56:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 12:56:58,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:58,661 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:58,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 12:56:58,861 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:58,862 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:58,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-07 12:56:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:58,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357963020] [2022-04-07 12:56:58,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:58,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:58,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:58,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701848005] [2022-04-07 12:56:58,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:56:58,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:58,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:58,882 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-07 12:56:58,883 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-07 12:56:58,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 12:56:58,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:56:58,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:56:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:58,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:59,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:56:59,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-07 12:56:59,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:56:59,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:56:59,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,183 INFO L272 TraceCheckUtils]: 8: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,184 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,184 INFO L272 TraceCheckUtils]: 13: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,185 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,185 INFO L272 TraceCheckUtils]: 18: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,186 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,186 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,187 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,187 INFO L272 TraceCheckUtils]: 28: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,187 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:59,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:56:59,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:56:59,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 5);havoc #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:56:59,189 INFO L272 TraceCheckUtils]: 36: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,190 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:56:59,190 INFO L272 TraceCheckUtils]: 41: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,190 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:56:59,190 INFO L272 TraceCheckUtils]: 46: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,191 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 12:56:59,192 INFO L272 TraceCheckUtils]: 51: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:59,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:59,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:56:59,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:56:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 12:56:59,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:59,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:56:59,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:56:59,578 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:56:59,578 INFO L272 TraceCheckUtils]: 51: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:56:59,579 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #63#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:56:59,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,579 INFO L272 TraceCheckUtils]: 46: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,579 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #61#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:56:59,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,580 INFO L272 TraceCheckUtils]: 41: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,580 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #59#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:56:59,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,580 INFO L272 TraceCheckUtils]: 36: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:56:59,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:56:59,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 12:56:59,585 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #67#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,585 INFO L272 TraceCheckUtils]: 28: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,585 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #65#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,585 INFO L272 TraceCheckUtils]: 23: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,586 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #63#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,586 INFO L272 TraceCheckUtils]: 18: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #61#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L272 TraceCheckUtils]: 13: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #59#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:59,587 INFO L272 TraceCheckUtils]: 8: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-07 12:56:59,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(#t~post5 < 5);havoc #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 12:56:59,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:56:59,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:56:59,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:59,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-07 12:56:59,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:56:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 12:56:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:59,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357963020] [2022-04-07 12:56:59,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:59,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701848005] [2022-04-07 12:56:59,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701848005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:59,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:59,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:56:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711754691] [2022-04-07 12:56:59,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:59,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-07 12:56:59,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:59,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:56:59,641 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-07 12:56:59,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:59,641 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:57:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:00,625 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-07 12:57:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:00,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-07 12:57:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:57:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:57:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:57:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:57:00,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:57:02,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:02,713 INFO L225 Difference]: With dead ends: 146 [2022-04-07 12:57:02,713 INFO L226 Difference]: Without dead ends: 135 [2022-04-07 12:57:02,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:02,714 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:02,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 12:57:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-07 12:57:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-07 12:57:02,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:02,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:02,768 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:02,768 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:02,770 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:57:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:57:02,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:02,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:02,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-07 12:57:02,771 INFO L87 Difference]: Start difference. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-07 12:57:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:02,774 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:57:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:57:02,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:02,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:02,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:02,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-07 12:57:02,776 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-07 12:57:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:02,777 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-07 12:57:02,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 12:57:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:57:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-07 12:57:02,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:02,778 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:02,795 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-07 12:57:02,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:02,993 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-07 12:57:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:02,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012587376] [2022-04-07 12:57:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:03,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:03,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094470122] [2022-04-07 12:57:03,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:03,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:03,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:03,028 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-07 12:57:03,029 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-07 12:57:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:03,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 12:57:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:03,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:07,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:57:07,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-07 12:57:07,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:57:07,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:57:07,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,071 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,071 INFO L272 TraceCheckUtils]: 13: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,071 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,071 INFO L272 TraceCheckUtils]: 18: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,072 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,072 INFO L272 TraceCheckUtils]: 23: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,081 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,081 INFO L272 TraceCheckUtils]: 28: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,082 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 12:57:07,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,083 INFO L272 TraceCheckUtils]: 36: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,088 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #59#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,089 INFO L272 TraceCheckUtils]: 41: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,089 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #61#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,089 INFO L272 TraceCheckUtils]: 46: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,090 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #63#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,090 INFO L272 TraceCheckUtils]: 51: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,091 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #65#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,091 INFO L272 TraceCheckUtils]: 56: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,091 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #67#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:07,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:57:07,092 INFO L272 TraceCheckUtils]: 62: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,092 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,092 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,093 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 12:57:07,094 INFO L272 TraceCheckUtils]: 67: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:07,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:07,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:57:07,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:57:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-07 12:57:07,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:07,591 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:57:07,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:57:07,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:07,592 INFO L272 TraceCheckUtils]: 67: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:07,593 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #69#return; {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-07 12:57:07,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,593 INFO L272 TraceCheckUtils]: 62: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !(~n~0 <= ~a~0); {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-07 12:57:07,594 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #67#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,594 INFO L272 TraceCheckUtils]: 56: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,595 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #65#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,595 INFO L272 TraceCheckUtils]: 51: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,595 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #63#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,596 INFO L272 TraceCheckUtils]: 46: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,596 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #61#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,596 INFO L272 TraceCheckUtils]: 41: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,597 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #59#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,597 INFO L272 TraceCheckUtils]: 36: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !!(#t~post5 < 5);havoc #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 12:57:07,601 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #67#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,601 INFO L272 TraceCheckUtils]: 28: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,601 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #65#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,602 INFO L272 TraceCheckUtils]: 23: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,602 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #63#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,602 INFO L272 TraceCheckUtils]: 18: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,603 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #61#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,603 INFO L272 TraceCheckUtils]: 13: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,603 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #59#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:07,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:07,604 INFO L272 TraceCheckUtils]: 8: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-07 12:57:07,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(#t~post5 < 5);havoc #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 12:57:07,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:57:07,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:57:07,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:07,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-07 12:57:07,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:57:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-07 12:57:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012587376] [2022-04-07 12:57:07,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094470122] [2022-04-07 12:57:07,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094470122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:07,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:07,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 12:57:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859255789] [2022-04-07 12:57:07,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-07 12:57:07,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:07,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:57:07,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:07,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 12:57:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 12:57:07,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:07,684 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:57:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:08,812 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-07 12:57:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:57:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-07 12:57:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:57:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:57:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:57:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:57:08,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-07 12:57:08,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:08,914 INFO L225 Difference]: With dead ends: 148 [2022-04-07 12:57:08,914 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 12:57:08,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:57:08,915 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:08,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:57:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 12:57:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-07 12:57:09,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:09,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:09,003 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:09,003 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:09,005 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:57:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:57:09,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:09,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:09,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-07 12:57:09,006 INFO L87 Difference]: Start difference. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-07 12:57:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:09,008 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:57:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:57:09,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:09,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:09,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:09,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-07 12:57:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-07 12:57:09,011 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-07 12:57:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:09,012 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-07 12:57:09,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 12:57:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-07 12:57:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 12:57:09,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:09,012 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:09,030 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-07 12:57:09,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 12:57:09,230 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-07 12:57:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:09,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308355269] [2022-04-07 12:57:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:09,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:09,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484616591] [2022-04-07 12:57:09,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:09,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:09,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:09,245 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-07 12:57:09,253 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-07 12:57:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:09,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:57:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:09,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:09,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-07 12:57:09,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {6368#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6368#true} is VALID [2022-04-07 12:57:09,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-07 12:57:09,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-07 12:57:09,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {6368#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,878 INFO L272 TraceCheckUtils]: 8: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,879 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,879 INFO L272 TraceCheckUtils]: 13: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,880 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,880 INFO L272 TraceCheckUtils]: 18: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,880 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,881 INFO L272 TraceCheckUtils]: 23: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,881 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,881 INFO L272 TraceCheckUtils]: 28: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,882 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:09,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,883 INFO L272 TraceCheckUtils]: 36: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,884 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,884 INFO L272 TraceCheckUtils]: 41: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,885 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,885 INFO L272 TraceCheckUtils]: 46: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,885 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,886 INFO L272 TraceCheckUtils]: 51: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,886 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,886 INFO L272 TraceCheckUtils]: 56: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,887 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-07 12:57:09,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-07 12:57:09,888 INFO L272 TraceCheckUtils]: 62: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,888 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,888 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,888 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-07 12:57:09,888 INFO L272 TraceCheckUtils]: 67: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6368#true} is VALID [2022-04-07 12:57:09,888 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:09,888 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:09,889 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:09,889 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-07 12:57:09,890 INFO L272 TraceCheckUtils]: 72: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:09,890 INFO L290 TraceCheckUtils]: 73: Hoare triple {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:09,891 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-07 12:57:09,891 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-07 12:57:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-07 12:57:09,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:10,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308355269] [2022-04-07 12:57:10,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:10,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484616591] [2022-04-07 12:57:10,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484616591] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:10,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:10,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 12:57:10,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572573174] [2022-04-07 12:57:10,618 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-07 12:57:10,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:10,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:10,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:10,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 12:57:10,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:10,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 12:57:10,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:10,648 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:11,041 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-07 12:57:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:11,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-07 12:57:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:57:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:57:11,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-07 12:57:11,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:11,080 INFO L225 Difference]: With dead ends: 143 [2022-04-07 12:57:11,081 INFO L226 Difference]: Without dead ends: 132 [2022-04-07 12:57:11,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:57:11,081 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:11,081 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:57:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-07 12:57:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-07 12:57:11,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:11,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:11,133 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:11,133 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:11,135 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:57:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:11,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:11,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:11,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-07 12:57:11,136 INFO L87 Difference]: Start difference. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-07 12:57:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:11,150 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:57:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:11,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:11,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:11,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:11,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-07 12:57:11,153 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-07 12:57:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:11,153 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-07 12:57:11,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-07 12:57:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 12:57:11,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:11,154 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:11,172 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-07 12:57:11,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:11,354 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-07 12:57:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:11,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023545754] [2022-04-07 12:57:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:11,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:11,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020856721] [2022-04-07 12:57:11,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:57:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:11,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:11,387 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-07 12:57:11,388 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-07 12:57:12,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:57:12,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:12,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-07 12:57:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-07 12:57:14,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:15,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:57:15,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-07 12:57:15,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:15,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:57:15,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:15,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:15,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:15,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:15,302 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #61#return; {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 12:57:15,302 INFO L272 TraceCheckUtils]: 18: Hoare triple {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:15,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:15,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:15,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:15,303 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:15,304 INFO L272 TraceCheckUtils]: 23: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:15,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:15,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:15,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:15,305 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:15,305 INFO L272 TraceCheckUtils]: 28: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:15,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:15,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:15,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:15,306 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:17,336 WARN L290 TraceCheckUtils]: 33: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-07 12:57:17,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:17,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:17,337 INFO L272 TraceCheckUtils]: 36: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:17,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:17,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:17,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:17,338 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:17,338 INFO L272 TraceCheckUtils]: 41: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:17,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:17,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:17,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:17,339 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:17,339 INFO L272 TraceCheckUtils]: 46: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:17,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:17,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:17,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:17,340 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #63#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:17,341 INFO L272 TraceCheckUtils]: 51: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:17,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:17,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:17,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:17,342 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:17,342 INFO L272 TraceCheckUtils]: 56: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:17,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:17,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:17,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:17,343 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:19,344 WARN L290 TraceCheckUtils]: 61: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-07 12:57:19,345 INFO L290 TraceCheckUtils]: 62: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:19,345 INFO L290 TraceCheckUtils]: 63: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:19,345 INFO L272 TraceCheckUtils]: 64: Hoare triple {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:19,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:19,346 INFO L290 TraceCheckUtils]: 66: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:19,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:19,347 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7487#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:19,347 INFO L272 TraceCheckUtils]: 69: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:19,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:19,348 INFO L290 TraceCheckUtils]: 71: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:19,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:19,348 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:57:19,349 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:19,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:19,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:57:19,350 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:57:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 47 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-04-07 12:57:19,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:20,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:57:20,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {7634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:57:20,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:20,230 INFO L272 TraceCheckUtils]: 74: Hoare triple {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:20,231 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7626#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:57:20,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:20,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:20,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:57:20,232 INFO L272 TraceCheckUtils]: 69: Hoare triple {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,232 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7653#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:20,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:20,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:20,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:57:20,233 INFO L272 TraceCheckUtils]: 64: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 5);havoc #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:20,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:20,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:20,241 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:20,242 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,242 INFO L272 TraceCheckUtils]: 56: Hoare triple {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,245 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #65#return; {7670#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-07 12:57:20,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:20,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:57:20,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7663#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:57:20,246 INFO L272 TraceCheckUtils]: 51: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L272 TraceCheckUtils]: 46: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L272 TraceCheckUtils]: 41: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,246 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L272 TraceCheckUtils]: 36: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {7397#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L272 TraceCheckUtils]: 28: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L272 TraceCheckUtils]: 23: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L272 TraceCheckUtils]: 18: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:20,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 5);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:57:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-07 12:57:20,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023545754] [2022-04-07 12:57:20,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020856721] [2022-04-07 12:57:20,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020856721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:20,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:20,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2022-04-07 12:57:20,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855585517] [2022-04-07 12:57:20,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-07 12:57:20,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:20,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:57:22,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:22,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 12:57:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 12:57:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:57:22,301 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:57:24,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:57:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:25,268 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-07 12:57:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 78 [2022-04-07 12:57:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:57:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:57:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:57:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:57:25,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-07 12:57:27,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:27,321 INFO L225 Difference]: With dead ends: 142 [2022-04-07 12:57:27,321 INFO L226 Difference]: Without dead ends: 138 [2022-04-07 12:57:27,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:57:27,322 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:27,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 12:57:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-07 12:57:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-07 12:57:27,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:27,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:27,410 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:27,411 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:27,413 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:57:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:27,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:27,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:27,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-07 12:57:27,414 INFO L87 Difference]: Start difference. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-07 12:57:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:27,416 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:57:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:27,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:27,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:27,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:27,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 12:57:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-07 12:57:27,419 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-07 12:57:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:27,419 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-07 12:57:27,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-04-07 12:57:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-07 12:57:27,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:27,420 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:27,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-07 12:57:27,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 12:57:27,626 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-07 12:57:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:27,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396026370] [2022-04-07 12:57:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:27,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392475543] [2022-04-07 12:57:27,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:27,637 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-07 12:57:27,638 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-07 12:57:27,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:27,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:27,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 12:57:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:27,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:28,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {8553#true} call ULTIMATE.init(); {8553#true} is VALID [2022-04-07 12:57:28,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {8553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8553#true} is VALID [2022-04-07 12:57:28,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8553#true} {8553#true} #81#return; {8553#true} is VALID [2022-04-07 12:57:28,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {8553#true} call #t~ret6 := main(); {8553#true} is VALID [2022-04-07 12:57:28,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {8553#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,356 INFO L272 TraceCheckUtils]: 8: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,357 INFO L272 TraceCheckUtils]: 13: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,357 INFO L272 TraceCheckUtils]: 18: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,358 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,358 INFO L272 TraceCheckUtils]: 23: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,359 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,359 INFO L272 TraceCheckUtils]: 28: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,359 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8553#true} {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:28,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {8573#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 5);havoc #t~post5; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,361 INFO L272 TraceCheckUtils]: 36: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,361 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,362 INFO L272 TraceCheckUtils]: 41: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,362 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #61#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,362 INFO L272 TraceCheckUtils]: 46: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,363 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #63#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,363 INFO L272 TraceCheckUtils]: 51: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,364 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #65#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,364 INFO L272 TraceCheckUtils]: 56: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,364 INFO L290 TraceCheckUtils]: 59: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,364 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8553#true} {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #67#return; {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:57:28,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {8658#(and (= main_~z~0 12) (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,366 INFO L272 TraceCheckUtils]: 64: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,367 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #59#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,367 INFO L272 TraceCheckUtils]: 69: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,367 INFO L290 TraceCheckUtils]: 70: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,367 INFO L290 TraceCheckUtils]: 72: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,367 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #61#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,367 INFO L272 TraceCheckUtils]: 74: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,368 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #63#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,368 INFO L272 TraceCheckUtils]: 79: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,369 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #65#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,369 INFO L272 TraceCheckUtils]: 84: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,369 INFO L290 TraceCheckUtils]: 87: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,369 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8553#true} {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} #67#return; {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-07 12:57:28,370 INFO L290 TraceCheckUtils]: 89: Hoare triple {8743#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= (+ main_~y~0 (- 18)) 1) (= (+ (- 2) main_~n~0) 0))} assume !(~n~0 <= ~a~0); {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:57:28,370 INFO L272 TraceCheckUtils]: 90: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,370 INFO L290 TraceCheckUtils]: 91: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,370 INFO L290 TraceCheckUtils]: 92: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,370 INFO L290 TraceCheckUtils]: 93: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,370 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #69#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:57:28,371 INFO L272 TraceCheckUtils]: 95: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8553#true} is VALID [2022-04-07 12:57:28,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {8553#true} ~cond := #in~cond; {8553#true} is VALID [2022-04-07 12:57:28,371 INFO L290 TraceCheckUtils]: 97: Hoare triple {8553#true} assume !(0 == ~cond); {8553#true} is VALID [2022-04-07 12:57:28,371 INFO L290 TraceCheckUtils]: 98: Hoare triple {8553#true} assume true; {8553#true} is VALID [2022-04-07 12:57:28,371 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {8553#true} {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} #71#return; {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} is VALID [2022-04-07 12:57:28,372 INFO L272 TraceCheckUtils]: 100: Hoare triple {8828#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ main_~y~0 (- 18)) 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:28,372 INFO L290 TraceCheckUtils]: 101: Hoare triple {8862#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8866#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:28,372 INFO L290 TraceCheckUtils]: 102: Hoare triple {8866#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8554#false} is VALID [2022-04-07 12:57:28,373 INFO L290 TraceCheckUtils]: 103: Hoare triple {8554#false} assume !false; {8554#false} is VALID [2022-04-07 12:57:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-07 12:57:28,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396026370] [2022-04-07 12:57:37,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:37,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392475543] [2022-04-07 12:57:37,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392475543] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:37,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:37,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 12:57:37,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32939060] [2022-04-07 12:57:37,922 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:37,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-07 12:57:37,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:37,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:37,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:37,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:37,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:57:37,971 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:38,606 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-07 12:57:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:57:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-07 12:57:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:57:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:57:38,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-07 12:57:38,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:38,670 INFO L225 Difference]: With dead ends: 140 [2022-04-07 12:57:38,670 INFO L226 Difference]: Without dead ends: 129 [2022-04-07 12:57:38,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:57:38,670 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:38,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:57:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-07 12:57:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-07 12:57:38,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:38,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:57:38,720 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:57:38,720 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:57:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:38,722 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:57:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:38,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:38,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:38,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-07 12:57:38,723 INFO L87 Difference]: Start difference. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-07 12:57:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:38,724 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:57:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:38,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:38,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:38,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:38,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 12:57:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-07 12:57:38,726 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-07 12:57:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:38,727 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-07 12:57:38,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-07 12:57:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 12:57:38,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:38,743 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:38,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-07 12:57:38,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 12:57:38,944 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-07 12:57:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:38,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432295991] [2022-04-07 12:57:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:38,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:38,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369837145] [2022-04-07 12:57:38,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:38,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:38,960 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-07 12:57:38,961 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-07 12:57:39,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:39,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:39,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 12:57:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:39,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:39,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {9649#true} call ULTIMATE.init(); {9649#true} is VALID [2022-04-07 12:57:39,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {9649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9649#true} is VALID [2022-04-07 12:57:39,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9649#true} {9649#true} #81#return; {9649#true} is VALID [2022-04-07 12:57:39,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {9649#true} call #t~ret6 := main(); {9649#true} is VALID [2022-04-07 12:57:39,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {9649#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,795 INFO L272 TraceCheckUtils]: 8: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,796 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,796 INFO L272 TraceCheckUtils]: 13: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,797 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,797 INFO L272 TraceCheckUtils]: 18: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,798 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,798 INFO L272 TraceCheckUtils]: 23: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,798 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,798 INFO L272 TraceCheckUtils]: 28: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,799 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9649#true} {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:39,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {9669#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,800 INFO L272 TraceCheckUtils]: 36: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,801 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #59#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,801 INFO L272 TraceCheckUtils]: 41: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,802 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #61#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,802 INFO L272 TraceCheckUtils]: 46: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,803 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #63#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,803 INFO L272 TraceCheckUtils]: 51: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,803 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #65#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,803 INFO L272 TraceCheckUtils]: 56: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,804 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9649#true} {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #67#return; {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-07 12:57:39,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {9754#(and (= (+ 5 main_~y~0) main_~z~0) (= main_~x~0 1) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,805 INFO L272 TraceCheckUtils]: 64: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,806 INFO L290 TraceCheckUtils]: 67: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,806 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #59#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,806 INFO L272 TraceCheckUtils]: 69: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,806 INFO L290 TraceCheckUtils]: 72: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,807 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #61#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,807 INFO L272 TraceCheckUtils]: 74: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,807 INFO L290 TraceCheckUtils]: 75: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,807 INFO L290 TraceCheckUtils]: 76: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,807 INFO L290 TraceCheckUtils]: 77: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,808 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #63#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,808 INFO L272 TraceCheckUtils]: 79: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,808 INFO L290 TraceCheckUtils]: 80: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,808 INFO L290 TraceCheckUtils]: 81: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,808 INFO L290 TraceCheckUtils]: 82: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,808 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #65#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,808 INFO L272 TraceCheckUtils]: 84: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,808 INFO L290 TraceCheckUtils]: 85: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,808 INFO L290 TraceCheckUtils]: 86: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,809 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9649#true} {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} #67#return; {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} is VALID [2022-04-07 12:57:39,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {9839#(and (= 6 (+ (- 2) main_~x~0)) (= main_~n~0 2) (= main_~z~0 (+ 7 main_~y~0 (* (- 1) main_~x~0))) (= (+ main_~x~0 4) (+ main_~y~0 (* (- 1) main_~x~0) 1)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,810 INFO L290 TraceCheckUtils]: 90: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,810 INFO L290 TraceCheckUtils]: 91: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !!(#t~post5 < 5);havoc #t~post5; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,810 INFO L272 TraceCheckUtils]: 92: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,810 INFO L290 TraceCheckUtils]: 93: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,811 INFO L290 TraceCheckUtils]: 94: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,811 INFO L290 TraceCheckUtils]: 95: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,811 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #59#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,811 INFO L272 TraceCheckUtils]: 97: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,811 INFO L290 TraceCheckUtils]: 98: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,811 INFO L290 TraceCheckUtils]: 99: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,811 INFO L290 TraceCheckUtils]: 100: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,812 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #61#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,812 INFO L272 TraceCheckUtils]: 102: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,812 INFO L290 TraceCheckUtils]: 103: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,812 INFO L290 TraceCheckUtils]: 104: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,812 INFO L290 TraceCheckUtils]: 105: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #63#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,813 INFO L272 TraceCheckUtils]: 107: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L290 TraceCheckUtils]: 108: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L290 TraceCheckUtils]: 109: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L290 TraceCheckUtils]: 110: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #65#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,813 INFO L272 TraceCheckUtils]: 112: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L290 TraceCheckUtils]: 113: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L290 TraceCheckUtils]: 114: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,813 INFO L290 TraceCheckUtils]: 115: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,814 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9649#true} {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} #67#return; {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,814 INFO L290 TraceCheckUtils]: 117: Hoare triple {9924#(and (= 12 (+ (- 15) main_~x~0)) (= main_~n~0 3) (= (+ main_~x~0 (- 3)) main_~z~0) (<= 2 main_~a~0))} assume !(~n~0 <= ~a~0); {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,814 INFO L272 TraceCheckUtils]: 118: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9649#true} is VALID [2022-04-07 12:57:39,814 INFO L290 TraceCheckUtils]: 119: Hoare triple {9649#true} ~cond := #in~cond; {9649#true} is VALID [2022-04-07 12:57:39,815 INFO L290 TraceCheckUtils]: 120: Hoare triple {9649#true} assume !(0 == ~cond); {9649#true} is VALID [2022-04-07 12:57:39,815 INFO L290 TraceCheckUtils]: 121: Hoare triple {9649#true} assume true; {9649#true} is VALID [2022-04-07 12:57:39,815 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9649#true} {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} #69#return; {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} is VALID [2022-04-07 12:57:39,816 INFO L272 TraceCheckUtils]: 123: Hoare triple {10009#(and (= 12 (+ (- 15) main_~x~0)) (= (+ main_~x~0 (- 3)) main_~z~0) (not (<= 3 main_~a~0)) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:57:39,816 INFO L290 TraceCheckUtils]: 124: Hoare triple {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:39,816 INFO L290 TraceCheckUtils]: 125: Hoare triple {10032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9650#false} is VALID [2022-04-07 12:57:39,816 INFO L290 TraceCheckUtils]: 126: Hoare triple {9650#false} assume !false; {9650#false} is VALID [2022-04-07 12:57:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-07 12:57:39,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:40,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:40,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432295991] [2022-04-07 12:57:40,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:40,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369837145] [2022-04-07 12:57:40,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369837145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:40,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:40,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:57:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708052029] [2022-04-07 12:57:40,129 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:40,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-07 12:57:40,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:40,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:57:40,176 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-07 12:57:40,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:57:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:57:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:57:40,177 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:57:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:40,983 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-07 12:57:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:57:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-07 12:57:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:57:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:57:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:57:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:57:40,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:57:41,050 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-07 12:57:41,052 INFO L225 Difference]: With dead ends: 152 [2022-04-07 12:57:41,052 INFO L226 Difference]: Without dead ends: 150 [2022-04-07 12:57:41,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:57:41,055 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:41,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:57:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-07 12:57:41,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-07 12:57:41,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:41,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:57:41,122 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:57:41,122 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:57:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:41,124 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:57:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:57:41,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:41,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:41,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-07 12:57:41,125 INFO L87 Difference]: Start difference. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-07 12:57:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:41,128 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:57:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:57:41,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:41,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:41,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:41,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:57:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-07 12:57:41,131 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-07 12:57:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:41,131 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-07 12:57:41,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-07 12:57:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-07 12:57:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-07 12:57:41,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:41,132 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:41,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-07 12:57:41,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 12:57:41,348 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-07 12:57:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:41,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203733624] [2022-04-07 12:57:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:41,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:41,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2146558761] [2022-04-07 12:57:41,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:41,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:41,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:41,376 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-07 12:57:41,377 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-07 12:57:41,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:41,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:41,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:57:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:41,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:41,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-07 12:57:41,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:41,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {10898#(<= ~counter~0 0)} assume true; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:41,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10898#(<= ~counter~0 0)} {10890#true} #81#return; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:41,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {10898#(<= ~counter~0 0)} call #t~ret6 := main(); {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:41,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {10898#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:41,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {10898#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,854 INFO L272 TraceCheckUtils]: 8: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,855 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #59#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,856 INFO L272 TraceCheckUtils]: 13: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,857 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #61#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,857 INFO L272 TraceCheckUtils]: 18: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,858 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #63#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,859 INFO L272 TraceCheckUtils]: 23: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,860 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #65#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,860 INFO L272 TraceCheckUtils]: 28: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {10914#(<= ~counter~0 1)} ~cond := #in~cond; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {10914#(<= ~counter~0 1)} assume !(0 == ~cond); {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {10914#(<= ~counter~0 1)} assume true; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,861 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10914#(<= ~counter~0 1)} {10914#(<= ~counter~0 1)} #67#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {10914#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:41,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {10914#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,863 INFO L272 TraceCheckUtils]: 36: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,892 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #59#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,893 INFO L272 TraceCheckUtils]: 41: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,894 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #61#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,895 INFO L272 TraceCheckUtils]: 46: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,896 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #63#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,897 INFO L272 TraceCheckUtils]: 51: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,898 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #65#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,899 INFO L272 TraceCheckUtils]: 56: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {10999#(<= ~counter~0 2)} ~cond := #in~cond; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {10999#(<= ~counter~0 2)} assume !(0 == ~cond); {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#(<= ~counter~0 2)} assume true; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,900 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10999#(<= ~counter~0 2)} {10999#(<= ~counter~0 2)} #67#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:41,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {10999#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {11084#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,902 INFO L272 TraceCheckUtils]: 64: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,903 INFO L290 TraceCheckUtils]: 67: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,903 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #59#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,904 INFO L272 TraceCheckUtils]: 69: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,904 INFO L290 TraceCheckUtils]: 70: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,905 INFO L290 TraceCheckUtils]: 72: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,905 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #61#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,906 INFO L272 TraceCheckUtils]: 74: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,907 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #63#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,908 INFO L272 TraceCheckUtils]: 79: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,909 INFO L290 TraceCheckUtils]: 82: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,909 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #65#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,910 INFO L272 TraceCheckUtils]: 84: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,910 INFO L290 TraceCheckUtils]: 85: Hoare triple {11084#(<= ~counter~0 3)} ~cond := #in~cond; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,910 INFO L290 TraceCheckUtils]: 86: Hoare triple {11084#(<= ~counter~0 3)} assume !(0 == ~cond); {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {11084#(<= ~counter~0 3)} assume true; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,911 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11084#(<= ~counter~0 3)} {11084#(<= ~counter~0 3)} #67#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,912 INFO L290 TraceCheckUtils]: 89: Hoare triple {11084#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:41,912 INFO L290 TraceCheckUtils]: 90: Hoare triple {11084#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,912 INFO L290 TraceCheckUtils]: 91: Hoare triple {11169#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,913 INFO L272 TraceCheckUtils]: 92: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,913 INFO L290 TraceCheckUtils]: 93: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,913 INFO L290 TraceCheckUtils]: 94: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,914 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #59#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,915 INFO L272 TraceCheckUtils]: 97: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,915 INFO L290 TraceCheckUtils]: 98: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,915 INFO L290 TraceCheckUtils]: 99: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,916 INFO L290 TraceCheckUtils]: 100: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,916 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #61#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,917 INFO L272 TraceCheckUtils]: 102: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,917 INFO L290 TraceCheckUtils]: 103: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,917 INFO L290 TraceCheckUtils]: 104: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,917 INFO L290 TraceCheckUtils]: 105: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,918 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #63#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,919 INFO L272 TraceCheckUtils]: 107: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,919 INFO L290 TraceCheckUtils]: 108: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,919 INFO L290 TraceCheckUtils]: 109: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,919 INFO L290 TraceCheckUtils]: 110: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,920 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #65#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,921 INFO L272 TraceCheckUtils]: 112: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,921 INFO L290 TraceCheckUtils]: 113: Hoare triple {11169#(<= ~counter~0 4)} ~cond := #in~cond; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,921 INFO L290 TraceCheckUtils]: 114: Hoare triple {11169#(<= ~counter~0 4)} assume !(0 == ~cond); {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,921 INFO L290 TraceCheckUtils]: 115: Hoare triple {11169#(<= ~counter~0 4)} assume true; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,922 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11169#(<= ~counter~0 4)} {11169#(<= ~counter~0 4)} #67#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,922 INFO L290 TraceCheckUtils]: 117: Hoare triple {11169#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:41,922 INFO L290 TraceCheckUtils]: 118: Hoare triple {11169#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11254#(<= |main_#t~post5| 4)} is VALID [2022-04-07 12:57:41,922 INFO L290 TraceCheckUtils]: 119: Hoare triple {11254#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {10891#false} is VALID [2022-04-07 12:57:41,922 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#false} is VALID [2022-04-07 12:57:41,922 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-07 12:57:41,922 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#false} assume !(0 == ~cond); {10891#false} is VALID [2022-04-07 12:57:41,923 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#false} assume true; {10891#false} is VALID [2022-04-07 12:57:41,923 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#false} {10891#false} #69#return; {10891#false} is VALID [2022-04-07 12:57:41,923 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-07 12:57:41,923 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-07 12:57:41,923 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-07 12:57:41,923 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-07 12:57:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-07 12:57:41,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:42,307 INFO L290 TraceCheckUtils]: 128: Hoare triple {10891#false} assume !false; {10891#false} is VALID [2022-04-07 12:57:42,307 INFO L290 TraceCheckUtils]: 127: Hoare triple {10891#false} assume 0 == ~cond; {10891#false} is VALID [2022-04-07 12:57:42,307 INFO L290 TraceCheckUtils]: 126: Hoare triple {10891#false} ~cond := #in~cond; {10891#false} is VALID [2022-04-07 12:57:42,307 INFO L272 TraceCheckUtils]: 125: Hoare triple {10891#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10891#false} is VALID [2022-04-07 12:57:42,307 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10890#true} {10891#false} #69#return; {10891#false} is VALID [2022-04-07 12:57:42,307 INFO L290 TraceCheckUtils]: 123: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,307 INFO L290 TraceCheckUtils]: 122: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,307 INFO L290 TraceCheckUtils]: 121: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,307 INFO L272 TraceCheckUtils]: 120: Hoare triple {10891#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,308 INFO L290 TraceCheckUtils]: 119: Hoare triple {11254#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {10891#false} is VALID [2022-04-07 12:57:42,308 INFO L290 TraceCheckUtils]: 118: Hoare triple {11169#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11254#(<= |main_#t~post5| 4)} is VALID [2022-04-07 12:57:42,308 INFO L290 TraceCheckUtils]: 117: Hoare triple {11169#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,309 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #67#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,309 INFO L290 TraceCheckUtils]: 115: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,309 INFO L290 TraceCheckUtils]: 114: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,309 INFO L290 TraceCheckUtils]: 113: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,309 INFO L272 TraceCheckUtils]: 112: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,309 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #65#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,309 INFO L272 TraceCheckUtils]: 107: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,310 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #63#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,310 INFO L290 TraceCheckUtils]: 105: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,310 INFO L290 TraceCheckUtils]: 104: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,310 INFO L290 TraceCheckUtils]: 103: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,310 INFO L272 TraceCheckUtils]: 102: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,316 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #61#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,316 INFO L290 TraceCheckUtils]: 100: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,316 INFO L290 TraceCheckUtils]: 99: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,316 INFO L290 TraceCheckUtils]: 98: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,316 INFO L272 TraceCheckUtils]: 97: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,316 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10890#true} {11169#(<= ~counter~0 4)} #59#return; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,316 INFO L290 TraceCheckUtils]: 95: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,316 INFO L290 TraceCheckUtils]: 94: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,317 INFO L272 TraceCheckUtils]: 92: Hoare triple {11169#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,317 INFO L290 TraceCheckUtils]: 91: Hoare triple {11169#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {11084#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11169#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:42,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {11084#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,318 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #67#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,318 INFO L290 TraceCheckUtils]: 87: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,318 INFO L272 TraceCheckUtils]: 84: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,318 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #65#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,319 INFO L290 TraceCheckUtils]: 82: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,319 INFO L290 TraceCheckUtils]: 81: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,319 INFO L272 TraceCheckUtils]: 79: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,319 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #63#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,319 INFO L290 TraceCheckUtils]: 75: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,319 INFO L272 TraceCheckUtils]: 74: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #61#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L272 TraceCheckUtils]: 69: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10890#true} {11084#(<= ~counter~0 3)} #59#return; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,320 INFO L272 TraceCheckUtils]: 64: Hoare triple {11084#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {11084#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {10999#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11084#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:42,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,322 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #67#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,322 INFO L272 TraceCheckUtils]: 56: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,326 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #65#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,326 INFO L272 TraceCheckUtils]: 51: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,327 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #63#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,327 INFO L272 TraceCheckUtils]: 46: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,327 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #61#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,328 INFO L272 TraceCheckUtils]: 41: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,328 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10890#true} {10999#(<= ~counter~0 2)} #59#return; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,329 INFO L272 TraceCheckUtils]: 36: Hoare triple {10999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {10914#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10999#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:42,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {10914#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,330 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #67#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,330 INFO L272 TraceCheckUtils]: 28: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,330 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #65#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,331 INFO L272 TraceCheckUtils]: 23: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,331 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #63#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,331 INFO L272 TraceCheckUtils]: 18: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #61#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L272 TraceCheckUtils]: 13: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10890#true} {10914#(<= ~counter~0 1)} #59#return; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {10890#true} assume true; {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {10890#true} assume !(0 == ~cond); {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {10890#true} ~cond := #in~cond; {10890#true} is VALID [2022-04-07 12:57:42,332 INFO L272 TraceCheckUtils]: 8: Hoare triple {10914#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10890#true} is VALID [2022-04-07 12:57:42,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {10898#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10914#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:42,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {10898#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:42,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {10898#(<= ~counter~0 0)} call #t~ret6 := main(); {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:42,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10898#(<= ~counter~0 0)} {10890#true} #81#return; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:42,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {10898#(<= ~counter~0 0)} assume true; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:42,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {10890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10898#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:42,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {10890#true} call ULTIMATE.init(); {10890#true} is VALID [2022-04-07 12:57:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-07 12:57:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:42,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203733624] [2022-04-07 12:57:42,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:42,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146558761] [2022-04-07 12:57:42,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146558761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:42,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:42,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-07 12:57:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740100533] [2022-04-07 12:57:42,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:42,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) Word has length 129 [2022-04-07 12:58:10,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:10,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-07 12:58:10,614 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-07 12:58:10,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:58:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:58:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:58:10,615 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-07 12:58:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:11,408 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2022-04-07 12:58:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 12:58:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) Word has length 129 [2022-04-07 12:58:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-07 12:58:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-04-07 12:58:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-07 12:58:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-04-07 12:58:11,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 116 transitions. [2022-04-07 12:58:11,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:11,496 INFO L225 Difference]: With dead ends: 183 [2022-04-07 12:58:11,497 INFO L226 Difference]: Without dead ends: 168 [2022-04-07 12:58:11,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:58:11,497 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:11,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 165 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:58:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-07 12:58:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-04-07 12:58:11,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:11,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:11,611 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:11,611 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:11,613 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-07 12:58:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-07 12:58:11,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:11,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-07 12:58:11,614 INFO L87 Difference]: Start difference. First operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-07 12:58:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:11,616 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-07 12:58:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-07 12:58:11,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:11,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:11,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:11,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 33 states have call successors, (33), 30 states have call predecessors, (33), 28 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2022-04-07 12:58:11,618 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 129 [2022-04-07 12:58:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:11,619 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2022-04-07 12:58:11,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 7 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (43), 6 states have call predecessors, (43), 6 states have call successors, (43) [2022-04-07 12:58:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2022-04-07 12:58:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 12:58:11,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:11,620 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:11,651 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-07 12:58:11,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 12:58:11,834 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-07 12:58:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:11,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070012932] [2022-04-07 12:58:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:11,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:11,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836328164] [2022-04-07 12:58:11,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:58:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:11,845 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-07 12:58:11,846 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-07 12:58:12,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 12:58:12,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:12,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:58:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:12,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:13,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {12507#true} call ULTIMATE.init(); {12507#true} is VALID [2022-04-07 12:58:13,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {12507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12507#true} is VALID [2022-04-07 12:58:13,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12507#true} {12507#true} #81#return; {12507#true} is VALID [2022-04-07 12:58:13,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {12507#true} call #t~ret6 := main(); {12507#true} is VALID [2022-04-07 12:58:13,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {12507#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 5);havoc #t~post5; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,061 INFO L272 TraceCheckUtils]: 8: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,062 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,062 INFO L272 TraceCheckUtils]: 13: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,063 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,063 INFO L272 TraceCheckUtils]: 18: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,063 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,063 INFO L272 TraceCheckUtils]: 23: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,064 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,064 INFO L272 TraceCheckUtils]: 28: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,065 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12507#true} {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:58:13,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {12527#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,066 INFO L272 TraceCheckUtils]: 36: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,066 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #59#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,067 INFO L272 TraceCheckUtils]: 41: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,067 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #61#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,067 INFO L272 TraceCheckUtils]: 46: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,068 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #63#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,068 INFO L272 TraceCheckUtils]: 51: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,069 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #65#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,069 INFO L272 TraceCheckUtils]: 56: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,069 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12507#true} {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} #67#return; {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-07 12:58:13,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {12612#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~n~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,070 INFO L272 TraceCheckUtils]: 64: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,071 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #59#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,071 INFO L272 TraceCheckUtils]: 69: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,071 INFO L290 TraceCheckUtils]: 70: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,072 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #61#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,072 INFO L272 TraceCheckUtils]: 74: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,072 INFO L290 TraceCheckUtils]: 75: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,072 INFO L290 TraceCheckUtils]: 76: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,072 INFO L290 TraceCheckUtils]: 77: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,073 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #63#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,073 INFO L272 TraceCheckUtils]: 79: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,073 INFO L290 TraceCheckUtils]: 80: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,073 INFO L290 TraceCheckUtils]: 81: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,073 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #65#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,073 INFO L272 TraceCheckUtils]: 84: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,073 INFO L290 TraceCheckUtils]: 85: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,074 INFO L290 TraceCheckUtils]: 86: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,074 INFO L290 TraceCheckUtils]: 87: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,074 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12507#true} {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #67#return; {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:58:13,075 INFO L290 TraceCheckUtils]: 89: Hoare triple {12697#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,075 INFO L290 TraceCheckUtils]: 90: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,075 INFO L290 TraceCheckUtils]: 91: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !!(#t~post5 < 5);havoc #t~post5; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,076 INFO L272 TraceCheckUtils]: 92: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,076 INFO L290 TraceCheckUtils]: 93: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,076 INFO L290 TraceCheckUtils]: 94: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,076 INFO L290 TraceCheckUtils]: 95: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,076 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #59#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,076 INFO L272 TraceCheckUtils]: 97: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,076 INFO L290 TraceCheckUtils]: 98: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,076 INFO L290 TraceCheckUtils]: 99: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,076 INFO L290 TraceCheckUtils]: 100: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,077 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #61#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,077 INFO L272 TraceCheckUtils]: 102: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,077 INFO L290 TraceCheckUtils]: 103: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,077 INFO L290 TraceCheckUtils]: 104: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,077 INFO L290 TraceCheckUtils]: 105: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,078 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #63#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,078 INFO L272 TraceCheckUtils]: 107: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,078 INFO L290 TraceCheckUtils]: 108: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,078 INFO L290 TraceCheckUtils]: 109: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,078 INFO L290 TraceCheckUtils]: 110: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,079 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #65#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,079 INFO L272 TraceCheckUtils]: 112: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,079 INFO L290 TraceCheckUtils]: 113: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,079 INFO L290 TraceCheckUtils]: 114: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,079 INFO L290 TraceCheckUtils]: 115: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,079 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {12507#true} {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} #67#return; {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,080 INFO L290 TraceCheckUtils]: 117: Hoare triple {12782#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ main_~z~0 (- 6)) 18) (= (+ (- 2) main_~n~0) 1) (= (+ main_~z~0 13) main_~y~0))} assume !(~n~0 <= ~a~0); {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,080 INFO L272 TraceCheckUtils]: 118: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,080 INFO L290 TraceCheckUtils]: 119: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,080 INFO L290 TraceCheckUtils]: 120: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,081 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12507#true} {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #69#return; {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,081 INFO L272 TraceCheckUtils]: 123: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12507#true} is VALID [2022-04-07 12:58:13,081 INFO L290 TraceCheckUtils]: 124: Hoare triple {12507#true} ~cond := #in~cond; {12507#true} is VALID [2022-04-07 12:58:13,081 INFO L290 TraceCheckUtils]: 125: Hoare triple {12507#true} assume !(0 == ~cond); {12507#true} is VALID [2022-04-07 12:58:13,081 INFO L290 TraceCheckUtils]: 126: Hoare triple {12507#true} assume true; {12507#true} is VALID [2022-04-07 12:58:13,081 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12507#true} {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} #71#return; {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} is VALID [2022-04-07 12:58:13,082 INFO L272 TraceCheckUtils]: 128: Hoare triple {12867#(and (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= (+ main_~z~0 (- 6)) 18) (= (+ main_~z~0 13) main_~y~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {12901#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:13,082 INFO L290 TraceCheckUtils]: 129: Hoare triple {12901#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12905#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:13,083 INFO L290 TraceCheckUtils]: 130: Hoare triple {12905#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12508#false} is VALID [2022-04-07 12:58:13,083 INFO L290 TraceCheckUtils]: 131: Hoare triple {12508#false} assume !false; {12508#false} is VALID [2022-04-07 12:58:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-07 12:58:13,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:18,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070012932] [2022-04-07 12:58:18,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:18,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836328164] [2022-04-07 12:58:18,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836328164] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:58:18,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:58:18,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:58:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495270709] [2022-04-07 12:58:18,044 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-07 12:58:18,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:18,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:58:18,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:18,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:58:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:18,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:58:18,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:58:18,104 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:58:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:19,082 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-04-07 12:58:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:58:19,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-07 12:58:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:58:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:58:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:58:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:58:19,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:58:19,170 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-07 12:58:19,172 INFO L225 Difference]: With dead ends: 168 [2022-04-07 12:58:19,172 INFO L226 Difference]: Without dead ends: 157 [2022-04-07 12:58:19,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:58:19,172 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:19,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:58:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-07 12:58:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-07 12:58:19,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:19,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 12:58:19,277 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 12:58:19,277 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 12:58:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:19,279 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-07 12:58:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-07 12:58:19,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:19,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:19,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 157 states. [2022-04-07 12:58:19,280 INFO L87 Difference]: Start difference. First operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 157 states. [2022-04-07 12:58:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:19,281 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-07 12:58:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-07 12:58:19,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:19,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:19,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:19,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-07 12:58:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2022-04-07 12:58:19,287 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 132 [2022-04-07 12:58:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:19,287 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2022-04-07 12:58:19,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-07 12:58:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-07 12:58:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-07 12:58:19,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:19,288 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:19,293 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-07 12:58:19,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:19,492 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-07 12:58:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:19,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159204212] [2022-04-07 12:58:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:19,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:19,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174716825] [2022-04-07 12:58:19,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:58:19,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:19,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:19,577 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:19,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-07 12:58:20,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-07 12:58:20,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:20,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:58:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:20,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:20,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {13822#true} call ULTIMATE.init(); {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {13822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13822#true} {13822#true} #81#return; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {13822#true} call #t~ret6 := main(); {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {13822#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L272 TraceCheckUtils]: 8: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,867 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L272 TraceCheckUtils]: 13: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L272 TraceCheckUtils]: 18: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L272 TraceCheckUtils]: 23: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L272 TraceCheckUtils]: 28: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L272 TraceCheckUtils]: 36: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L272 TraceCheckUtils]: 41: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:20,869 INFO L272 TraceCheckUtils]: 46: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,870 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:20,870 INFO L272 TraceCheckUtils]: 51: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L272 TraceCheckUtils]: 56: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 59: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L272 TraceCheckUtils]: 64: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 65: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 66: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,871 INFO L290 TraceCheckUtils]: 67: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L272 TraceCheckUtils]: 69: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 70: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 71: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L272 TraceCheckUtils]: 74: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 75: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 76: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 77: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L272 TraceCheckUtils]: 79: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 80: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 81: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 82: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L272 TraceCheckUtils]: 84: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,872 INFO L290 TraceCheckUtils]: 85: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 86: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 87: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 89: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 91: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L272 TraceCheckUtils]: 92: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 93: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 95: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L272 TraceCheckUtils]: 97: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 98: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 99: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L290 TraceCheckUtils]: 100: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,873 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L272 TraceCheckUtils]: 102: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 103: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 104: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 105: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L272 TraceCheckUtils]: 107: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 108: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 109: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 110: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L272 TraceCheckUtils]: 112: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 113: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 114: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L290 TraceCheckUtils]: 115: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,874 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:20,876 INFO L290 TraceCheckUtils]: 117: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-07 12:58:20,876 INFO L290 TraceCheckUtils]: 118: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-07 12:58:20,877 INFO L290 TraceCheckUtils]: 119: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {14178#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-07 12:58:20,877 INFO L272 TraceCheckUtils]: 120: Hoare triple {14178#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,877 INFO L290 TraceCheckUtils]: 121: Hoare triple {13822#true} ~cond := #in~cond; {14191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:20,877 INFO L290 TraceCheckUtils]: 122: Hoare triple {14191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:20,878 INFO L290 TraceCheckUtils]: 123: Hoare triple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:20,878 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} {14178#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:58:20,878 INFO L272 TraceCheckUtils]: 125: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,878 INFO L290 TraceCheckUtils]: 126: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,878 INFO L290 TraceCheckUtils]: 127: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,878 INFO L290 TraceCheckUtils]: 128: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,879 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:58:20,879 INFO L272 TraceCheckUtils]: 130: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,879 INFO L290 TraceCheckUtils]: 131: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,879 INFO L290 TraceCheckUtils]: 132: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,879 INFO L290 TraceCheckUtils]: 133: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,880 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:58:20,880 INFO L272 TraceCheckUtils]: 135: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,880 INFO L290 TraceCheckUtils]: 136: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,880 INFO L290 TraceCheckUtils]: 137: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,880 INFO L290 TraceCheckUtils]: 138: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,880 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:58:20,880 INFO L272 TraceCheckUtils]: 140: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,880 INFO L290 TraceCheckUtils]: 141: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,880 INFO L290 TraceCheckUtils]: 142: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,881 INFO L290 TraceCheckUtils]: 143: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,881 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {13822#true} {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-07 12:58:20,882 INFO L290 TraceCheckUtils]: 145: Hoare triple {14202#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:58:20,882 INFO L272 TraceCheckUtils]: 146: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:20,882 INFO L290 TraceCheckUtils]: 147: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:20,882 INFO L290 TraceCheckUtils]: 148: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:20,882 INFO L290 TraceCheckUtils]: 149: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:20,882 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13822#true} {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:58:22,770 INFO L272 TraceCheckUtils]: 151: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:58:22,770 INFO L290 TraceCheckUtils]: 152: Hoare triple {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:22,770 INFO L290 TraceCheckUtils]: 153: Hoare triple {14289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13823#false} is VALID [2022-04-07 12:58:22,771 INFO L290 TraceCheckUtils]: 154: Hoare triple {13823#false} assume !false; {13823#false} is VALID [2022-04-07 12:58:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-07 12:58:22,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:23,746 INFO L290 TraceCheckUtils]: 154: Hoare triple {13823#false} assume !false; {13823#false} is VALID [2022-04-07 12:58:23,746 INFO L290 TraceCheckUtils]: 153: Hoare triple {14289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13823#false} is VALID [2022-04-07 12:58:23,747 INFO L290 TraceCheckUtils]: 152: Hoare triple {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:25,748 WARN L272 TraceCheckUtils]: 151: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {14285#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-07 12:58:25,756 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {13822#true} {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:58:25,756 INFO L290 TraceCheckUtils]: 149: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,757 INFO L290 TraceCheckUtils]: 148: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,757 INFO L290 TraceCheckUtils]: 147: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,757 INFO L272 TraceCheckUtils]: 146: Hoare triple {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,758 INFO L290 TraceCheckUtils]: 145: Hoare triple {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {14266#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-07 12:58:25,758 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {13822#true} {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #67#return; {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:25,758 INFO L290 TraceCheckUtils]: 143: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,758 INFO L290 TraceCheckUtils]: 142: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,758 INFO L290 TraceCheckUtils]: 141: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,759 INFO L272 TraceCheckUtils]: 140: Hoare triple {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,759 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {13822#true} {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #65#return; {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:25,759 INFO L290 TraceCheckUtils]: 138: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,759 INFO L290 TraceCheckUtils]: 137: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,759 INFO L290 TraceCheckUtils]: 136: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,759 INFO L272 TraceCheckUtils]: 135: Hoare triple {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,760 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {13822#true} {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #63#return; {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:25,760 INFO L290 TraceCheckUtils]: 133: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,760 INFO L290 TraceCheckUtils]: 132: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,760 INFO L290 TraceCheckUtils]: 131: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,760 INFO L272 TraceCheckUtils]: 130: Hoare triple {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,761 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {13822#true} {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} #61#return; {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:25,761 INFO L290 TraceCheckUtils]: 128: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,761 INFO L290 TraceCheckUtils]: 127: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,761 INFO L290 TraceCheckUtils]: 126: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,761 INFO L272 TraceCheckUtils]: 125: Hoare triple {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,762 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} {14387#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #59#return; {14323#(or (and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:25,763 INFO L290 TraceCheckUtils]: 123: Hoare triple {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:25,763 INFO L290 TraceCheckUtils]: 122: Hoare triple {14397#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:25,763 INFO L290 TraceCheckUtils]: 121: Hoare triple {13822#true} ~cond := #in~cond; {14397#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:58:25,763 INFO L272 TraceCheckUtils]: 120: Hoare triple {14387#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,764 INFO L290 TraceCheckUtils]: 119: Hoare triple {14387#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {14387#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:58:25,764 INFO L290 TraceCheckUtils]: 118: Hoare triple {14387#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14387#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:58:25,765 INFO L290 TraceCheckUtils]: 117: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {14387#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:58:25,765 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L290 TraceCheckUtils]: 115: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L290 TraceCheckUtils]: 114: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L290 TraceCheckUtils]: 113: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L272 TraceCheckUtils]: 112: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L290 TraceCheckUtils]: 109: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,765 INFO L290 TraceCheckUtils]: 108: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L272 TraceCheckUtils]: 107: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 105: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 104: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 103: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L272 TraceCheckUtils]: 102: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 100: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 99: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 98: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L272 TraceCheckUtils]: 97: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 95: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 94: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 93: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L272 TraceCheckUtils]: 92: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,766 INFO L290 TraceCheckUtils]: 91: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 90: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 89: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 87: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 86: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 85: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L272 TraceCheckUtils]: 84: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 82: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 81: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 80: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L272 TraceCheckUtils]: 79: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 77: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 76: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L272 TraceCheckUtils]: 74: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 71: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 70: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L272 TraceCheckUtils]: 69: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 65: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L272 TraceCheckUtils]: 64: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:25,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L272 TraceCheckUtils]: 56: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L272 TraceCheckUtils]: 51: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 47: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L272 TraceCheckUtils]: 46: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L272 TraceCheckUtils]: 41: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L272 TraceCheckUtils]: 36: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {13822#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13822#true} {13822#true} #67#return; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L272 TraceCheckUtils]: 28: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13822#true} {13822#true} #65#return; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L272 TraceCheckUtils]: 23: Hoare triple {13822#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13822#true} {13822#true} #63#return; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {13822#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13822#true} {13822#true} #61#return; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L272 TraceCheckUtils]: 13: Hoare triple {13822#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13822#true} {13822#true} #59#return; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {13822#true} assume !(0 == ~cond); {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {13822#true} ~cond := #in~cond; {13822#true} is VALID [2022-04-07 12:58:25,771 INFO L272 TraceCheckUtils]: 8: Hoare triple {13822#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {13822#true} assume !!(#t~post5 < 5);havoc #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {13822#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {13822#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {13822#true} call #t~ret6 := main(); {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13822#true} {13822#true} #81#return; {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {13822#true} assume true; {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {13822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {13822#true} call ULTIMATE.init(); {13822#true} is VALID [2022-04-07 12:58:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-07 12:58:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:25,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159204212] [2022-04-07 12:58:25,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:25,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174716825] [2022-04-07 12:58:25,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174716825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:58:25,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:58:25,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-07 12:58:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715627107] [2022-04-07 12:58:25,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-07 12:58:25,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:25,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:26,064 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-07 12:58:26,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 12:58:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 12:58:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:58:26,065 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:30,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:58:32,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:58:37,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:58:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:37,076 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-04-07 12:58:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:58:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-07 12:58:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:58:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:58:37,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-07 12:58:39,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:39,148 INFO L225 Difference]: With dead ends: 166 [2022-04-07 12:58:39,148 INFO L226 Difference]: Without dead ends: 164 [2022-04-07 12:58:39,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:58:39,148 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:39,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 145 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-07 12:58:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-07 12:58:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2022-04-07 12:58:39,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:39,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:39,276 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:39,276 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:39,278 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-07 12:58:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-07 12:58:39,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:39,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:39,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-07 12:58:39,279 INFO L87 Difference]: Start difference. First operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-07 12:58:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:39,281 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-07 12:58:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-07 12:58:39,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:39,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:39,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:39,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 104 states have internal predecessors, (105), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-07 12:58:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2022-04-07 12:58:39,283 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 155 [2022-04-07 12:58:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:39,283 INFO L478 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2022-04-07 12:58:39,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2022-04-07 12:58:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-07 12:58:39,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:39,284 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:39,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:39,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 12:58:39,489 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:39,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2040587668, now seen corresponding path program 3 times [2022-04-07 12:58:39,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:39,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762779557] [2022-04-07 12:58:39,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:39,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:39,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448374528] [2022-04-07 12:58:39,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:58:39,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:39,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:39,500 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:39,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-07 12:58:39,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-04-07 12:58:39,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 12:58:39,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 12:58:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 12:58:39,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 12:58:39,955 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 12:58:39,956 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:58:39,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:40,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:40,165 INFO L719 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-04-07 12:58:40,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:58:40,216 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:58:40,216 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 12:58:40,216 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 12:58:40,216 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 12:58:40,216 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 12:58:40,216 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,217 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-07 12:58:40,218 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 12:58:40,219 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:58:40,219 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:58:40,219 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:58:40,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:58:40 BoogieIcfgContainer [2022-04-07 12:58:40,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:58:40,220 INFO L158 Benchmark]: Toolchain (without parser) took 110386.96ms. Allocated memory was 172.0MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 146.4MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2022-04-07 12:58:40,220 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:58:40,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.66ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 146.4MB in the beginning and 176.5MB in the end (delta: -30.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-07 12:58:40,220 INFO L158 Benchmark]: Boogie Preprocessor took 40.17ms. Allocated memory is still 206.6MB. Free memory was 176.5MB in the beginning and 175.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 12:58:40,220 INFO L158 Benchmark]: RCFGBuilder took 272.21ms. Allocated memory is still 206.6MB. Free memory was 174.9MB in the beginning and 163.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 12:58:40,230 INFO L158 Benchmark]: TraceAbstraction took 109832.29ms. Allocated memory was 206.6MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 162.8MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2022-04-07 12:58:40,230 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.09ms. Allocated memory is still 172.0MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.66ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 146.4MB in the beginning and 176.5MB in the end (delta: -30.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.17ms. Allocated memory is still 206.6MB. Free memory was 176.5MB in the beginning and 175.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 272.21ms. Allocated memory is still 206.6MB. Free memory was 174.9MB in the beginning and 163.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 109832.29ms. Allocated memory was 206.6MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 162.8MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=10, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=5, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=5, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=5, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=5, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=5, counter=6, n=5, x=125, y=91, z=36] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 109.7s, OverallIterations: 19, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 2578 SdHoareTripleChecker+Invalid, 11.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1775 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2432 IncrementalHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 803 mSDtfsCounter, 2432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1805 SyntacticMatches, 16 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=16, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1770 ConstructedInterpolants, 0 QuantifiedInterpolants, 7221 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2551 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 8523/9498 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 12:58:40,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...