./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:15:01,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:15:01,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:15:01,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:15:01,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:15:01,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:15:01,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:15:01,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:15:01,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:15:01,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:15:01,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:15:01,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:15:01,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:15:01,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:15:01,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:15:01,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:15:01,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:15:01,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:15:01,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:15:01,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:15:01,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:15:01,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:15:01,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:15:01,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:15:01,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:15:01,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:15:01,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:15:01,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:15:01,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:15:01,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:15:01,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:15:01,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:15:01,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:15:01,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:15:01,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:15:01,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:15:01,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:15:01,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:15:01,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:15:01,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:15:01,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:15:01,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:15:01,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:15:01,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:15:01,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:15:01,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:15:01,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:15:01,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:15:01,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:15:01,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:15:01,552 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:15:01,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:15:01,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:15:01,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:15:01,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:15:01,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:15:01,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:15:01,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:15:01,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:15:01,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:15:01,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:15:01,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:15:01,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:15:01,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:15:01,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:15:01,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:15:01,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:15:01,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:15:01,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:15:01,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:15:01,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:15:01,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:15:01,556 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:15:01,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:15:01,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:15:01,556 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a [2022-02-20 17:15:01,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:15:01,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:15:01,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:15:01,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:15:01,785 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:15:01,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2022-02-20 17:15:01,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68493e139/2b8d370f78a74ba3825af5fd4ed7c835/FLAGc64fc0060 [2022-02-20 17:15:02,225 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:15:02,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2022-02-20 17:15:02,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68493e139/2b8d370f78a74ba3825af5fd4ed7c835/FLAGc64fc0060 [2022-02-20 17:15:02,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68493e139/2b8d370f78a74ba3825af5fd4ed7c835 [2022-02-20 17:15:02,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:15:02,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:15:02,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:15:02,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:15:02,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:15:02,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d5bf5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02, skipping insertion in model container [2022-02-20 17:15:02,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:15:02,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:15:02,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c[588,601] [2022-02-20 17:15:02,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:15:02,444 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:15:02,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c[588,601] [2022-02-20 17:15:02,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:15:02,480 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:15:02,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02 WrapperNode [2022-02-20 17:15:02,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:15:02,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:15:02,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:15:02,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:15:02,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,524 INFO L137 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 17:15:02,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:15:02,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:15:02,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:15:02,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:15:02,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:15:02,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:15:02,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:15:02,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:15:02,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (1/1) ... [2022-02-20 17:15:02,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:15:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:02,576 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-02-20 17:15:02,581 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-02-20 17:15:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:15:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:15:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:15:02,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:15:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:15:02,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:15:02,641 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:15:02,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:15:02,752 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:15:02,757 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:15:02,757 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:15:02,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:15:02 BoogieIcfgContainer [2022-02-20 17:15:02,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:15:02,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:15:02,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:15:02,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:15:02,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:15:02" (1/3) ... [2022-02-20 17:15:02,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f908fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:15:02, skipping insertion in model container [2022-02-20 17:15:02,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:02" (2/3) ... [2022-02-20 17:15:02,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f908fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:15:02, skipping insertion in model container [2022-02-20 17:15:02,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:15:02" (3/3) ... [2022-02-20 17:15:02,780 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound10.c [2022-02-20 17:15:02,783 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:15:02,783 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:15:02,825 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:15:02,829 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:15:02,829 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:15:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:15:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:15:02,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:02,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:02,860 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:02,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:02,868 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2022-02-20 17:15:02,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:02,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095769425] [2022-02-20 17:15:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:03,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } 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); {30#true} is VALID [2022-02-20 17:15:03,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {30#true} is VALID [2022-02-20 17:15:03,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {31#false} is VALID [2022-02-20 17:15:03,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#false} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {31#false} is VALID [2022-02-20 17:15:03,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#false} assume false; {31#false} is VALID [2022-02-20 17:15:03,031 INFO L272 TraceCheckUtils]: 5: Hoare triple {31#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {31#false} is VALID [2022-02-20 17:15:03,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-02-20 17:15:03,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-02-20 17:15:03,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:15:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:03,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:03,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095769425] [2022-02-20 17:15:03,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095769425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:03,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:03,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:15:03,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570824592] [2022-02-20 17:15:03,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:03,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:15:03,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:03,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:03,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:15:03,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:03,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:15:03,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:15:03,092 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:03,147 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2022-02-20 17:15:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:15:03,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:15:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2022-02-20 17:15:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2022-02-20 17:15:03,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2022-02-20 17:15:03,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:03,288 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:15:03,288 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:15:03,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:15:03,294 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:03,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:15:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:15:03,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:03,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,317 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,317 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:03,321 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2022-02-20 17:15:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-02-20 17:15:03,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:03,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:03,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 23 states. [2022-02-20 17:15:03,323 INFO L87 Difference]: Start difference. First operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 23 states. [2022-02-20 17:15:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:03,330 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2022-02-20 17:15:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-02-20 17:15:03,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:03,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:03,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:03,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-02-20 17:15:03,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2022-02-20 17:15:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:03,339 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-02-20 17:15:03,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-02-20 17:15:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:15:03,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:03,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:03,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:15:03,340 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:03,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2022-02-20 17:15:03,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:03,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452784803] [2022-02-20 17:15:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:03,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {195#true} assume { :begin_inline_ULTIMATE.init } 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); {195#true} is VALID [2022-02-20 17:15:03,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {195#true} is VALID [2022-02-20 17:15:03,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume !(0 == assume_abort_if_not_~cond#1); {195#true} is VALID [2022-02-20 17:15:03,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {195#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:15:03,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} assume !false; {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:15:03,482 INFO L272 TraceCheckUtils]: 5: Hoare triple {197#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:03,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {199#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:03,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {196#false} is VALID [2022-02-20 17:15:03,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-02-20 17:15:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:03,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:03,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452784803] [2022-02-20 17:15:03,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452784803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:03,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:03,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:03,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715963568] [2022-02-20 17:15:03,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:03,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:15:03,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:03,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:03,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:03,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:03,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:03,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:03,497 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:03,664 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-02-20 17:15:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:15:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:15:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:15:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:15:03,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 17:15:03,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:03,703 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:15:03,703 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:15:03,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-20 17:15:03,704 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:03,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 85 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:15:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:15:03,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:03,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,709 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,709 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:03,711 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 17:15:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:15:03,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:03,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:03,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 27 states. [2022-02-20 17:15:03,712 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 27 states. [2022-02-20 17:15:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:03,714 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 17:15:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:15:03,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:03,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:03,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:03,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:15:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-20 17:15:03,716 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2022-02-20 17:15:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:03,716 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-20 17:15:03,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:15:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:15:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:15:03,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:03,717 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:03,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:15:03,717 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:03,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2022-02-20 17:15:03,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:03,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535843662] [2022-02-20 17:15:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:03,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:03,766 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:03,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185566553] [2022-02-20 17:15:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:03,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:03,769 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-02-20 17:15:03,775 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-02-20 17:15:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:03,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:15:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:03,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:03,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#true} assume { :begin_inline_ULTIMATE.init } 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); {342#true} is VALID [2022-02-20 17:15:03,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {342#true} is VALID [2022-02-20 17:15:03,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {342#true} assume !(0 == assume_abort_if_not_~cond#1); {342#true} is VALID [2022-02-20 17:15:03,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {342#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:03,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !false; {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:03,943 INFO L272 TraceCheckUtils]: 5: Hoare triple {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {342#true} is VALID [2022-02-20 17:15:03,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#true} ~cond := #in~cond; {342#true} is VALID [2022-02-20 17:15:03,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#true} assume !(0 == ~cond); {342#true} is VALID [2022-02-20 17:15:03,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#true} assume true; {342#true} is VALID [2022-02-20 17:15:03,944 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {342#true} {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #54#return; {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:03,945 INFO L272 TraceCheckUtils]: 10: Hoare triple {356#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:03,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:03,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {343#false} is VALID [2022-02-20 17:15:03,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-02-20 17:15:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:03,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:03,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:03,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535843662] [2022-02-20 17:15:03,948 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:03,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185566553] [2022-02-20 17:15:03,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185566553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:03,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:03,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:03,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489961942] [2022-02-20 17:15:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:03,950 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:15:03,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:03,951 INFO L86 InductivityCheck]: Starting indutivity 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:15:03,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:03,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:03,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:03,964 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:15:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:04,167 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 17:15:04,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:04,167 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:15:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:04,168 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:15:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:04,170 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:15:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:04,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:15:04,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:04,240 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:15:04,240 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:15:04,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-02-20 17:15:04,243 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:04,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:15:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-02-20 17:15:04,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:04,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:04,251 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:04,251 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:04,253 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-02-20 17:15:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2022-02-20 17:15:04,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:04,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:04,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:15:04,255 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:15:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:04,257 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-02-20 17:15:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2022-02-20 17:15:04,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:04,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:04,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:04,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:15:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 17:15:04,260 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 14 [2022-02-20 17:15:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:04,260 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 17:15:04,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:15:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 17:15:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:15:04,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:04,261 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:04,280 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-02-20 17:15:04,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:04,479 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2022-02-20 17:15:04,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:04,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214978758] [2022-02-20 17:15:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:04,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:04,492 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:04,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918972362] [2022-02-20 17:15:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:04,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:04,493 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-02-20 17:15:04,494 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-02-20 17:15:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:04,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:15:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:04,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:04,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#true} assume { :begin_inline_ULTIMATE.init } 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); {603#true} is VALID [2022-02-20 17:15:04,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {603#true} is VALID [2022-02-20 17:15:04,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume !(0 == assume_abort_if_not_~cond#1); {603#true} is VALID [2022-02-20 17:15:04,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {603#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:04,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:04,603 INFO L272 TraceCheckUtils]: 5: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {603#true} is VALID [2022-02-20 17:15:04,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-02-20 17:15:04,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-02-20 17:15:04,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#true} assume true; {603#true} is VALID [2022-02-20 17:15:04,604 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {603#true} {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:04,605 INFO L272 TraceCheckUtils]: 10: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {603#true} is VALID [2022-02-20 17:15:04,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-02-20 17:15:04,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-02-20 17:15:04,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#true} assume true; {603#true} is VALID [2022-02-20 17:15:04,606 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {603#true} {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #56#return; {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:04,606 INFO L272 TraceCheckUtils]: 15: Hoare triple {617#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:04,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:04,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {604#false} is VALID [2022-02-20 17:15:04,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-02-20 17:15:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:15:04,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:04,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:04,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214978758] [2022-02-20 17:15:04,608 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:04,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918972362] [2022-02-20 17:15:04,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918972362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:04,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:04,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:04,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555955614] [2022-02-20 17:15:04,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:04,609 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:15:04,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:04,610 INFO L86 InductivityCheck]: Starting indutivity 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:04,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:04,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:04,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:04,624 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:04,795 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-02-20 17:15:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:04,796 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:15:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:04,796 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:04,797 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:04,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:15:04,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:04,871 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:15:04,871 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:15:04,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-02-20 17:15:04,873 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:04,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:15:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:15:04,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:04,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:04,890 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:04,892 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:04,896 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2022-02-20 17:15:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2022-02-20 17:15:04,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:04,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:04,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:15:04,898 INFO L87 Difference]: Start difference. First operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:15:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:04,902 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2022-02-20 17:15:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2022-02-20 17:15:04,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:04,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:04,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:04,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-02-20 17:15:04,915 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 19 [2022-02-20 17:15:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:04,916 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-02-20 17:15:04,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:15:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 17:15:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:15:04,916 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:04,916 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:04,932 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-02-20 17:15:05,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:15:05,125 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2022-02-20 17:15:05,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:05,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875580402] [2022-02-20 17:15:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:05,137 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:05,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075580013] [2022-02-20 17:15:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:05,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:05,138 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-02-20 17:15:05,139 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-02-20 17:15:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:05,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:15:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:05,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:05,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {908#true} assume { :begin_inline_ULTIMATE.init } 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); {908#true} is VALID [2022-02-20 17:15:05,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {908#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {908#true} is VALID [2022-02-20 17:15:05,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {908#true} assume !(0 == assume_abort_if_not_~cond#1); {908#true} is VALID [2022-02-20 17:15:05,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {908#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:05,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:05,289 INFO L272 TraceCheckUtils]: 5: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {908#true} is VALID [2022-02-20 17:15:05,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {908#true} ~cond := #in~cond; {908#true} is VALID [2022-02-20 17:15:05,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {908#true} assume !(0 == ~cond); {908#true} is VALID [2022-02-20 17:15:05,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#true} assume true; {908#true} is VALID [2022-02-20 17:15:05,290 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {908#true} {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:05,290 INFO L272 TraceCheckUtils]: 10: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {908#true} is VALID [2022-02-20 17:15:05,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#true} ~cond := #in~cond; {908#true} is VALID [2022-02-20 17:15:05,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {908#true} assume !(0 == ~cond); {908#true} is VALID [2022-02-20 17:15:05,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {908#true} assume true; {908#true} is VALID [2022-02-20 17:15:05,291 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {908#true} {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:05,291 INFO L272 TraceCheckUtils]: 15: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {908#true} is VALID [2022-02-20 17:15:05,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {908#true} ~cond := #in~cond; {908#true} is VALID [2022-02-20 17:15:05,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#true} assume !(0 == ~cond); {908#true} is VALID [2022-02-20 17:15:05,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {908#true} assume true; {908#true} is VALID [2022-02-20 17:15:05,292 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {908#true} {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:05,292 INFO L272 TraceCheckUtils]: 20: Hoare triple {922#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {974#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:05,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {974#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {978#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:05,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {978#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {909#false} is VALID [2022-02-20 17:15:05,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {909#false} assume !false; {909#false} is VALID [2022-02-20 17:15:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:15:05,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:05,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:05,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875580402] [2022-02-20 17:15:05,294 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:05,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075580013] [2022-02-20 17:15:05,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075580013] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:05,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:05,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:05,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602158018] [2022-02-20 17:15:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:05,294 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:15:05,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:05,296 INFO L86 InductivityCheck]: Starting indutivity 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:05,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:05,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:05,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:05,311 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:05,537 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-02-20 17:15:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:05,537 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:15:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:05,537 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:05,538 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:15:05,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:15:05,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:05,594 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:15:05,594 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:15:05,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-02-20 17:15:05,595 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:05,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:15:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:15:05,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:05,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:05,603 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:05,604 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:05,605 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-02-20 17:15:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-02-20 17:15:05,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:05,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:05,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:15:05,606 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:15:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:05,608 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-02-20 17:15:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-02-20 17:15:05,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:05,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:05,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:05,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-02-20 17:15:05,610 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 24 [2022-02-20 17:15:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:05,611 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-02-20 17:15:05,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-02-20 17:15:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:15:05,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:05,612 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:05,628 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-02-20 17:15:05,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:05,827 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash -492592860, now seen corresponding path program 1 times [2022-02-20 17:15:05,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:05,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840396362] [2022-02-20 17:15:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:05,843 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:05,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440637859] [2022-02-20 17:15:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:05,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:05,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:05,859 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-02-20 17:15:05,860 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-02-20 17:15:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:05,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:15:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:05,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:06,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#true} assume { :begin_inline_ULTIMATE.init } 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); {1235#true} is VALID [2022-02-20 17:15:06,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1235#true} is VALID [2022-02-20 17:15:06,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1235#true} assume !(0 == assume_abort_if_not_~cond#1); {1235#true} is VALID [2022-02-20 17:15:06,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,093 INFO L272 TraceCheckUtils]: 5: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,094 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,094 INFO L272 TraceCheckUtils]: 10: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,095 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,095 INFO L272 TraceCheckUtils]: 15: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,097 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,097 INFO L272 TraceCheckUtils]: 20: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,098 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,098 INFO L272 TraceCheckUtils]: 25: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,101 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1235#true} {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {1249#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:06,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:06,102 INFO L272 TraceCheckUtils]: 32: Hoare triple {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,103 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1235#true} {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:06,104 INFO L272 TraceCheckUtils]: 37: Hoare triple {1331#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:06,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:06,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {1357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1236#false} is VALID [2022-02-20 17:15:06,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {1236#false} assume !false; {1236#false} is VALID [2022-02-20 17:15:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:15:06,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:06,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {1236#false} assume !false; {1236#false} is VALID [2022-02-20 17:15:06,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {1357#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1236#false} is VALID [2022-02-20 17:15:06,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1357#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:06,276 INFO L272 TraceCheckUtils]: 37: Hoare triple {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:06,283 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1235#true} {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} #54#return; {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:15:06,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,284 INFO L272 TraceCheckUtils]: 32: Hoare triple {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} assume !false; {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:15:06,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1373#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:15:06,289 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #62#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,290 INFO L272 TraceCheckUtils]: 25: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,291 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #60#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,291 INFO L272 TraceCheckUtils]: 20: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,292 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #58#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,292 INFO L272 TraceCheckUtils]: 15: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,293 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #56#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,293 INFO L272 TraceCheckUtils]: 10: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,294 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1235#true} {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #54#return; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#true} assume true; {1235#true} is VALID [2022-02-20 17:15:06,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#true} assume !(0 == ~cond); {1235#true} is VALID [2022-02-20 17:15:06,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#true} ~cond := #in~cond; {1235#true} is VALID [2022-02-20 17:15:06,294 INFO L272 TraceCheckUtils]: 5: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1235#true} is VALID [2022-02-20 17:15:06,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} assume !false; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1395#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:06,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1235#true} assume !(0 == assume_abort_if_not_~cond#1); {1235#true} is VALID [2022-02-20 17:15:06,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1235#true} is VALID [2022-02-20 17:15:06,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#true} assume { :begin_inline_ULTIMATE.init } 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); {1235#true} is VALID [2022-02-20 17:15:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:15:06,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:06,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840396362] [2022-02-20 17:15:06,296 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:06,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440637859] [2022-02-20 17:15:06,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440637859] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:06,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:06,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:15:06,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045500373] [2022-02-20 17:15:06,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:06,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-02-20 17:15:06,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:06,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:06,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:06,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:06,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:15:06,338 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:09,057 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-02-20 17:15:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-02-20 17:15:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:09,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-02-20 17:15:09,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:09,150 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:15:09,150 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 17:15:09,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 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-02-20 17:15:09,151 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:09,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:15:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 17:15:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-02-20 17:15:09,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:09,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:09,161 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:09,161 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:09,164 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-02-20 17:15:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-02-20 17:15:09,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:09,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:09,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-02-20 17:15:09,165 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 67 states. [2022-02-20 17:15:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:09,167 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-02-20 17:15:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-02-20 17:15:09,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:09,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:09,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:09,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-02-20 17:15:09,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 41 [2022-02-20 17:15:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:09,169 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-02-20 17:15:09,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:15:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-02-20 17:15:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:15:09,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:09,171 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:09,189 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-02-20 17:15:09,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:09,383 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 2 times [2022-02-20 17:15:09,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:09,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200776024] [2022-02-20 17:15:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:09,394 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:09,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087880747] [2022-02-20 17:15:09,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:09,395 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-02-20 17:15:09,396 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-02-20 17:15:09,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:09,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:09,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:15:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:09,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:09,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {1810#true} assume { :begin_inline_ULTIMATE.init } 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); {1810#true} is VALID [2022-02-20 17:15:09,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {1810#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1810#true} is VALID [2022-02-20 17:15:09,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {1810#true} assume !(0 == assume_abort_if_not_~cond#1); {1810#true} is VALID [2022-02-20 17:15:09,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {1810#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:09,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:09,618 INFO L272 TraceCheckUtils]: 5: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,619 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:09,619 INFO L272 TraceCheckUtils]: 10: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,620 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #56#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:09,620 INFO L272 TraceCheckUtils]: 15: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,621 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #58#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:09,621 INFO L272 TraceCheckUtils]: 20: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,623 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #60#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:09,623 INFO L272 TraceCheckUtils]: 25: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,624 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1810#true} {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #62#return; {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:15:09,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {1824#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:09,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:09,625 INFO L272 TraceCheckUtils]: 32: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,626 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1810#true} {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:09,626 INFO L272 TraceCheckUtils]: 37: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,627 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1810#true} {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:09,630 INFO L272 TraceCheckUtils]: 42: Hoare triple {1906#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:09,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1947#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:09,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {1947#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1811#false} is VALID [2022-02-20 17:15:09,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {1811#false} assume !false; {1811#false} is VALID [2022-02-20 17:15:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:15:09,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:09,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {1811#false} assume !false; {1811#false} is VALID [2022-02-20 17:15:09,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {1947#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1811#false} is VALID [2022-02-20 17:15:09,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1947#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:09,780 INFO L272 TraceCheckUtils]: 42: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1943#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:09,781 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1810#true} {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} #56#return; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:09,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,781 INFO L272 TraceCheckUtils]: 37: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,782 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1810#true} {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} #54#return; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:09,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,782 INFO L272 TraceCheckUtils]: 32: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !false; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:09,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1963#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:09,785 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #62#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:09,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,785 INFO L272 TraceCheckUtils]: 25: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,786 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #60#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:09,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,786 INFO L272 TraceCheckUtils]: 20: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,787 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #58#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:09,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,787 INFO L272 TraceCheckUtils]: 15: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,788 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #56#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:09,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,788 INFO L272 TraceCheckUtils]: 10: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,789 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1810#true} {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #54#return; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:09,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#true} assume true; {1810#true} is VALID [2022-02-20 17:15:09,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#true} assume !(0 == ~cond); {1810#true} is VALID [2022-02-20 17:15:09,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {1810#true} ~cond := #in~cond; {1810#true} is VALID [2022-02-20 17:15:09,793 INFO L272 TraceCheckUtils]: 5: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1810#true} is VALID [2022-02-20 17:15:09,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} assume !false; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:09,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {1810#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2000#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:15:09,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {1810#true} assume !(0 == assume_abort_if_not_~cond#1); {1810#true} is VALID [2022-02-20 17:15:09,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {1810#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1810#true} is VALID [2022-02-20 17:15:09,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {1810#true} assume { :begin_inline_ULTIMATE.init } 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); {1810#true} is VALID [2022-02-20 17:15:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:15:09,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:09,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200776024] [2022-02-20 17:15:09,799 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:09,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087880747] [2022-02-20 17:15:09,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087880747] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:09,799 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:09,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:15:09,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820783081] [2022-02-20 17:15:09,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:09,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-02-20 17:15:09,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:09,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:09,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:09,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:09,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:15:09,836 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:10,208 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-02-20 17:15:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:15:10,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-02-20 17:15:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 17:15:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 17:15:10,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-02-20 17:15:10,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:10,272 INFO L225 Difference]: With dead ends: 73 [2022-02-20 17:15:10,272 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:15:10,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 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-02-20 17:15:10,273 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:10,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 268 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:15:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2022-02-20 17:15:10,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:10,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:10,284 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:10,284 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:10,286 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-02-20 17:15:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-02-20 17:15:10,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:10,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:10,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 71 states. [2022-02-20 17:15:10,287 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 71 states. [2022-02-20 17:15:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:10,289 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-02-20 17:15:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-02-20 17:15:10,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:10,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:10,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:10,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:15:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-02-20 17:15:10,292 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 46 [2022-02-20 17:15:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:10,292 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-02-20 17:15:10,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:15:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-02-20 17:15:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 17:15:10,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:10,293 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:10,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-02-20 17:15:10,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:10,509 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash 900098756, now seen corresponding path program 3 times [2022-02-20 17:15:10,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:10,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824752458] [2022-02-20 17:15:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:10,522 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:10,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087901844] [2022-02-20 17:15:10,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:15:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:10,524 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-02-20 17:15:10,525 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-02-20 17:15:10,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 17:15:10,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:10,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:15:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:10,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:10,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#true} assume { :begin_inline_ULTIMATE.init } 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); {2437#true} is VALID [2022-02-20 17:15:10,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2437#true} is VALID [2022-02-20 17:15:10,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} assume !(0 == assume_abort_if_not_~cond#1); {2437#true} is VALID [2022-02-20 17:15:10,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:10,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:10,801 INFO L272 TraceCheckUtils]: 5: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,804 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:10,804 INFO L272 TraceCheckUtils]: 10: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,805 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:10,805 INFO L272 TraceCheckUtils]: 15: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,806 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:10,806 INFO L272 TraceCheckUtils]: 20: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,806 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:10,806 INFO L272 TraceCheckUtils]: 25: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,817 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2437#true} {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:10,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {2451#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:10,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} assume !false; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:10,819 INFO L272 TraceCheckUtils]: 32: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,819 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2437#true} {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} #54#return; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:10,819 INFO L272 TraceCheckUtils]: 37: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,820 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2437#true} {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} #56#return; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:10,820 INFO L272 TraceCheckUtils]: 42: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:10,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:10,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:10,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:10,821 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2437#true} {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} #58#return; {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:15:10,821 INFO L272 TraceCheckUtils]: 47: Hoare triple {2533#(and (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:10,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:10,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {2589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2438#false} is VALID [2022-02-20 17:15:10,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 17:15:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:15:10,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:11,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 17:15:11,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {2589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2438#false} is VALID [2022-02-20 17:15:11,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:11,073 INFO L272 TraceCheckUtils]: 47: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:11,074 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2437#true} {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #58#return; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:11,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,074 INFO L272 TraceCheckUtils]: 42: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,075 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2437#true} {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #56#return; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:11,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,076 INFO L272 TraceCheckUtils]: 37: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,076 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2437#true} {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #54#return; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:11,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,077 INFO L272 TraceCheckUtils]: 32: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} assume !false; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:11,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {2605#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:15:11,081 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #62#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:11,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,081 INFO L272 TraceCheckUtils]: 25: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,082 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #60#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:11,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,082 INFO L272 TraceCheckUtils]: 20: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,083 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #58#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:11,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,083 INFO L272 TraceCheckUtils]: 15: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,084 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #56#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:11,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,084 INFO L272 TraceCheckUtils]: 10: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,085 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2437#true} {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #54#return; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:11,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 17:15:11,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {2437#true} assume !(0 == ~cond); {2437#true} is VALID [2022-02-20 17:15:11,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {2437#true} ~cond := #in~cond; {2437#true} is VALID [2022-02-20 17:15:11,085 INFO L272 TraceCheckUtils]: 5: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2437#true} is VALID [2022-02-20 17:15:11,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} assume !false; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:11,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2657#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:15:11,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} assume !(0 == assume_abort_if_not_~cond#1); {2437#true} is VALID [2022-02-20 17:15:11,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2437#true} is VALID [2022-02-20 17:15:11,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#true} assume { :begin_inline_ULTIMATE.init } 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); {2437#true} is VALID [2022-02-20 17:15:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:15:11,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:11,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824752458] [2022-02-20 17:15:11,087 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:11,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087901844] [2022-02-20 17:15:11,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087901844] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:11,087 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:11,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:15:11,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246610582] [2022-02-20 17:15:11,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:11,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-02-20 17:15:11,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:11,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:11,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:11,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:11,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:11,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:15:11,136 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:11,982 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-02-20 17:15:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-02-20 17:15:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-02-20 17:15:11,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-02-20 17:15:12,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:12,078 INFO L225 Difference]: With dead ends: 85 [2022-02-20 17:15:12,078 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 17:15:12,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:15:12,078 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:12,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:15:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 17:15:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-02-20 17:15:12,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:12,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:12,092 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:12,092 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:12,094 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-02-20 17:15:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-02-20 17:15:12,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:12,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:12,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 77 states. [2022-02-20 17:15:12,095 INFO L87 Difference]: Start difference. First operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 77 states. [2022-02-20 17:15:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:12,097 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-02-20 17:15:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-02-20 17:15:12,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:12,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:12,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:12,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-02-20 17:15:12,115 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 51 [2022-02-20 17:15:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:12,115 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-02-20 17:15:12,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-02-20 17:15:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:15:12,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:12,117 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:12,135 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-02-20 17:15:12,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:12,318 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2022-02-20 17:15:12,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:12,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945272570] [2022-02-20 17:15:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:12,328 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:12,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692292588] [2022-02-20 17:15:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:12,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:12,334 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-02-20 17:15:12,336 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-02-20 17:15:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:12,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 17:15:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:12,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:12,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {3132#true} assume { :begin_inline_ULTIMATE.init } 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); {3132#true} is VALID [2022-02-20 17:15:12,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {3132#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3132#true} is VALID [2022-02-20 17:15:12,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {3132#true} assume !(0 == assume_abort_if_not_~cond#1); {3132#true} is VALID [2022-02-20 17:15:12,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {3132#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:12,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:12,803 INFO L272 TraceCheckUtils]: 5: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,804 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:12,804 INFO L272 TraceCheckUtils]: 10: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,805 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:12,805 INFO L272 TraceCheckUtils]: 15: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,806 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:12,806 INFO L272 TraceCheckUtils]: 20: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,810 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:12,810 INFO L272 TraceCheckUtils]: 25: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,811 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3132#true} {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:12,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {3146#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:12,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:12,812 INFO L272 TraceCheckUtils]: 32: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,813 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:12,813 INFO L272 TraceCheckUtils]: 37: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,814 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:12,814 INFO L272 TraceCheckUtils]: 42: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,815 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:12,815 INFO L272 TraceCheckUtils]: 47: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,815 INFO L290 TraceCheckUtils]: 50: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,815 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:12,816 INFO L272 TraceCheckUtils]: 52: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,816 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3132#true} {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:12,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {3228#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~n~0#1 <= main_~a~0#1); {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:12,817 INFO L272 TraceCheckUtils]: 58: Hoare triple {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3132#true} is VALID [2022-02-20 17:15:12,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {3132#true} ~cond := #in~cond; {3132#true} is VALID [2022-02-20 17:15:12,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {3132#true} assume !(0 == ~cond); {3132#true} is VALID [2022-02-20 17:15:12,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {3132#true} assume true; {3132#true} is VALID [2022-02-20 17:15:12,818 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3132#true} {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #64#return; {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:12,818 INFO L272 TraceCheckUtils]: 63: Hoare triple {3310#(and (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:12,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {3329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:12,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {3333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3133#false} is VALID [2022-02-20 17:15:12,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2022-02-20 17:15:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 17:15:12,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:13,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:13,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945272570] [2022-02-20 17:15:13,165 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:13,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692292588] [2022-02-20 17:15:13,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692292588] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:13,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:13,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:15:13,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398495646] [2022-02-20 17:15:13,166 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:13,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 67 [2022-02-20 17:15:13,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:13,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:13,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:13,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:15:13,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:15:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:15:13,210 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:13,526 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-02-20 17:15:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:13,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 67 [2022-02-20 17:15:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:13,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 17:15:13,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:13,591 INFO L225 Difference]: With dead ends: 87 [2022-02-20 17:15:13,591 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 17:15:13,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:15:13,593 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:13,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 17:15:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-02-20 17:15:13,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:13,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:13,648 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:13,648 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:13,650 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-02-20 17:15:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-02-20 17:15:13,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:13,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:13,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 85 states. [2022-02-20 17:15:13,651 INFO L87 Difference]: Start difference. First operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 85 states. [2022-02-20 17:15:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:13,653 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-02-20 17:15:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-02-20 17:15:13,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:13,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:13,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:13,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-02-20 17:15:13,656 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 67 [2022-02-20 17:15:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:13,656 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-02-20 17:15:13,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:15:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-02-20 17:15:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 17:15:13,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:13,657 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:13,680 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-02-20 17:15:13,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:13,857 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2022-02-20 17:15:13,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:13,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702604240] [2022-02-20 17:15:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:13,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:13,866 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:13,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100817703] [2022-02-20 17:15:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:13,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:13,867 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-02-20 17:15:13,868 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-02-20 17:15:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:13,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:15:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:13,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:14,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {3874#true} assume { :begin_inline_ULTIMATE.init } 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); {3874#true} is VALID [2022-02-20 17:15:14,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {3874#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3874#true} is VALID [2022-02-20 17:15:14,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {3874#true} assume !(0 == assume_abort_if_not_~cond#1); {3874#true} is VALID [2022-02-20 17:15:14,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {3874#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:14,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !false; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:14,509 INFO L272 TraceCheckUtils]: 5: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,510 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #54#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:14,510 INFO L272 TraceCheckUtils]: 10: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,510 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #56#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:14,511 INFO L272 TraceCheckUtils]: 15: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,511 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #58#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:14,511 INFO L272 TraceCheckUtils]: 20: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,512 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #60#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:14,512 INFO L272 TraceCheckUtils]: 25: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,512 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3874#true} {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #62#return; {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:15:14,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {3888#(and (<= 6 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:14,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:14,513 INFO L272 TraceCheckUtils]: 32: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,514 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:14,514 INFO L272 TraceCheckUtils]: 37: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:14,521 INFO L272 TraceCheckUtils]: 42: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:14,521 INFO L272 TraceCheckUtils]: 47: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,522 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:14,522 INFO L272 TraceCheckUtils]: 52: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,522 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3874#true} {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:14,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {3970#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~n~0#1 <= main_~a~0#1); {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:14,523 INFO L272 TraceCheckUtils]: 58: Hoare triple {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,524 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3874#true} {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} #64#return; {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:14,524 INFO L272 TraceCheckUtils]: 63: Hoare triple {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3874#true} is VALID [2022-02-20 17:15:14,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2022-02-20 17:15:14,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2022-02-20 17:15:14,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {3874#true} assume true; {3874#true} is VALID [2022-02-20 17:15:14,524 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3874#true} {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} #66#return; {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:14,525 INFO L272 TraceCheckUtils]: 68: Hoare triple {4052#(and (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= 12 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~a~0#1 * main_~z~0#1 - 6 * main_~a~0#1 - 2 * main_~y~0#1 + 2 * main_~z~0#1 - 10 then 1 else 0)); {4086#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:14,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {4086#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4090#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:14,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {4090#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3875#false} is VALID [2022-02-20 17:15:14,526 INFO L290 TraceCheckUtils]: 71: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2022-02-20 17:15:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-20 17:15:14,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:21,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:21,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702604240] [2022-02-20 17:15:21,139 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:21,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100817703] [2022-02-20 17:15:21,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100817703] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:21,140 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:21,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:15:21,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144886535] [2022-02-20 17:15:21,140 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:21,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2022-02-20 17:15:21,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:21,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:21,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:21,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:15:21,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:21,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:15:21,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:15:21,174 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:21,519 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-02-20 17:15:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:21,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2022-02-20 17:15:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 17:15:21,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 17:15:21,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:21,573 INFO L225 Difference]: With dead ends: 91 [2022-02-20 17:15:21,573 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 17:15:21,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 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-02-20 17:15:21,574 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:21,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 17:15:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 17:15:21,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:21,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:21,598 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:21,599 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:21,601 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-02-20 17:15:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 17:15:21,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:21,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:21,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 78 states. [2022-02-20 17:15:21,602 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 78 states. [2022-02-20 17:15:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:21,603 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-02-20 17:15:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 17:15:21,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:21,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:21,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:21,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-02-20 17:15:21,605 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 72 [2022-02-20 17:15:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:21,606 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-02-20 17:15:21,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:15:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-20 17:15:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 17:15:21,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:21,606 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:21,625 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-02-20 17:15:21,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:15:21,819 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1961933060, now seen corresponding path program 4 times [2022-02-20 17:15:21,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:21,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385351832] [2022-02-20 17:15:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:21,828 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:21,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575618890] [2022-02-20 17:15:21,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:15:21,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:21,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:21,834 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-02-20 17:15:21,835 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-02-20 17:15:21,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:15:21,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:21,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:15:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:21,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:22,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {4628#true} assume { :begin_inline_ULTIMATE.init } 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); {4628#true} is VALID [2022-02-20 17:15:22,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {4628#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4628#true} is VALID [2022-02-20 17:15:22,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {4628#true} assume !(0 == assume_abort_if_not_~cond#1); {4628#true} is VALID [2022-02-20 17:15:22,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {4628#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:22,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:22,262 INFO L272 TraceCheckUtils]: 5: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,263 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:22,263 INFO L272 TraceCheckUtils]: 10: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,265 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:22,265 INFO L272 TraceCheckUtils]: 15: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,265 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:22,266 INFO L272 TraceCheckUtils]: 20: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,266 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:22,266 INFO L272 TraceCheckUtils]: 25: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,267 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4628#true} {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:22,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:22,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:22,268 INFO L272 TraceCheckUtils]: 32: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,268 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:22,268 INFO L272 TraceCheckUtils]: 37: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {4628#true} ~cond := #in~cond; {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:22,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,269 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:22,270 INFO L272 TraceCheckUtils]: 42: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,270 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:22,270 INFO L272 TraceCheckUtils]: 47: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,271 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:22,271 INFO L272 TraceCheckUtils]: 52: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,272 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4628#true} {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:22,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {4724#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 12) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:15:22,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} assume !false; {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:15:22,273 INFO L272 TraceCheckUtils]: 59: Hoare triple {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,274 INFO L290 TraceCheckUtils]: 62: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,274 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4628#true} {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} #54#return; {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:15:22,274 INFO L272 TraceCheckUtils]: 64: Hoare triple {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {4628#true} ~cond := #in~cond; {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:22,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {4749#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,276 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4808#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= 19 |ULTIMATE.start_main_~y~0#1|))} #56#return; {4842#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:15:22,276 INFO L272 TraceCheckUtils]: 69: Hoare triple {4842#(and (= 2 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:22,277 INFO L290 TraceCheckUtils]: 70: Hoare triple {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:22,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {4850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4629#false} is VALID [2022-02-20 17:15:22,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {4629#false} assume !false; {4629#false} is VALID [2022-02-20 17:15:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 70 proven. 29 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-02-20 17:15:22,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:22,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {4629#false} assume !false; {4629#false} is VALID [2022-02-20 17:15:22,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {4850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4629#false} is VALID [2022-02-20 17:15:22,962 INFO L290 TraceCheckUtils]: 70: Hoare triple {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:22,962 INFO L272 TraceCheckUtils]: 69: Hoare triple {4866#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:22,963 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #56#return; {4866#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:22,963 INFO L290 TraceCheckUtils]: 67: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {4628#true} ~cond := #in~cond; {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:22,964 INFO L272 TraceCheckUtils]: 64: Hoare triple {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,965 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4628#true} {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #54#return; {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:22,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,965 INFO L272 TraceCheckUtils]: 59: Hoare triple {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !false; {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:22,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4870#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:22,973 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4628#true} {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} #62#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:22,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,974 INFO L272 TraceCheckUtils]: 52: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,974 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4628#true} {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} #60#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:22,974 INFO L290 TraceCheckUtils]: 50: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,985 INFO L272 TraceCheckUtils]: 47: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,986 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4628#true} {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} #58#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:22,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,987 INFO L272 TraceCheckUtils]: 42: Hoare triple {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,988 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #56#return; {4905#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:22,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:22,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {4628#true} ~cond := #in~cond; {4880#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:22,989 INFO L272 TraceCheckUtils]: 37: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,989 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #54#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:22,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:22,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:22,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:22,990 INFO L272 TraceCheckUtils]: 32: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:22,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !false; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:22,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,000 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #62#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:23,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:23,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:23,001 INFO L272 TraceCheckUtils]: 25: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:23,001 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #60#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:23,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:23,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:23,001 INFO L272 TraceCheckUtils]: 20: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:23,002 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #58#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:23,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:23,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:23,002 INFO L272 TraceCheckUtils]: 15: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #56#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L272 TraceCheckUtils]: 10: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4628#true} {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #54#return; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {4628#true} assume true; {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {4628#true} assume !(0 == ~cond); {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {4628#true} ~cond := #in~cond; {4628#true} is VALID [2022-02-20 17:15:23,003 INFO L272 TraceCheckUtils]: 5: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4628#true} is VALID [2022-02-20 17:15:23,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !false; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {4628#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {4954#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:23,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {4628#true} assume !(0 == assume_abort_if_not_~cond#1); {4628#true} is VALID [2022-02-20 17:15:23,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {4628#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4628#true} is VALID [2022-02-20 17:15:23,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {4628#true} assume { :begin_inline_ULTIMATE.init } 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); {4628#true} is VALID [2022-02-20 17:15:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-20 17:15:23,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:23,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385351832] [2022-02-20 17:15:23,006 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:23,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575618890] [2022-02-20 17:15:23,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575618890] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:23,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:23,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-02-20 17:15:23,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416621308] [2022-02-20 17:15:23,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:23,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 73 [2022-02-20 17:15:23,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:23,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:23,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:23,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:15:23,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:23,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:15:23,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:15:23,086 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:24,661 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-02-20 17:15:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:15:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 73 [2022-02-20 17:15:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-02-20 17:15:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-02-20 17:15:24,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2022-02-20 17:15:24,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:24,751 INFO L225 Difference]: With dead ends: 109 [2022-02-20 17:15:24,751 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 17:15:24,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:15:24,752 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:24,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 161 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 17:15:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 17:15:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2022-02-20 17:15:24,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:24,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:24,781 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:24,781 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:24,783 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-02-20 17:15:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-02-20 17:15:24,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:24,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:24,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 107 states. [2022-02-20 17:15:24,784 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 107 states. [2022-02-20 17:15:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:24,786 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-02-20 17:15:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-02-20 17:15:24,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:24,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:24,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:24,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:15:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-02-20 17:15:24,788 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 73 [2022-02-20 17:15:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:24,788 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-02-20 17:15:24,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-20 17:15:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-02-20 17:15:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 17:15:24,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:24,789 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:24,806 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-02-20 17:15:24,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:24,999 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 671163038, now seen corresponding path program 2 times [2022-02-20 17:15:24,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:24,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89921077] [2022-02-20 17:15:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:25,009 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:25,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935091801] [2022-02-20 17:15:25,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:25,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:25,010 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-02-20 17:15:25,018 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-02-20 17:15:25,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:25,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:25,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 17:15:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:25,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:25,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {5594#true} assume { :begin_inline_ULTIMATE.init } 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); {5594#true} is VALID [2022-02-20 17:15:25,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5594#true} is VALID [2022-02-20 17:15:25,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {5594#true} assume !(0 == assume_abort_if_not_~cond#1); {5594#true} is VALID [2022-02-20 17:15:25,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {5594#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,669 INFO L272 TraceCheckUtils]: 5: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,670 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,670 INFO L272 TraceCheckUtils]: 10: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,683 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,684 INFO L272 TraceCheckUtils]: 15: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,684 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,685 INFO L272 TraceCheckUtils]: 20: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,685 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,685 INFO L272 TraceCheckUtils]: 25: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,686 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5594#true} {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:25,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {5608#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:25,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !false; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:25,687 INFO L272 TraceCheckUtils]: 32: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,688 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #54#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:25,688 INFO L272 TraceCheckUtils]: 37: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,689 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #56#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:25,689 INFO L272 TraceCheckUtils]: 42: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,690 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #58#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:25,690 INFO L272 TraceCheckUtils]: 47: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,691 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #60#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:25,691 INFO L272 TraceCheckUtils]: 52: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,692 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5594#true} {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #62#return; {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:25,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {5690#(and (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !false; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,693 INFO L272 TraceCheckUtils]: 59: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,694 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #54#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,694 INFO L272 TraceCheckUtils]: 64: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,694 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #56#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,694 INFO L272 TraceCheckUtils]: 69: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,695 INFO L290 TraceCheckUtils]: 72: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,695 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #58#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,695 INFO L272 TraceCheckUtils]: 74: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,695 INFO L290 TraceCheckUtils]: 75: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,696 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #60#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,696 INFO L272 TraceCheckUtils]: 79: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,696 INFO L290 TraceCheckUtils]: 80: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,696 INFO L290 TraceCheckUtils]: 81: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,696 INFO L290 TraceCheckUtils]: 82: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,697 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {5594#true} {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #62#return; {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,697 INFO L290 TraceCheckUtils]: 84: Hoare triple {5772#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (= |ULTIMATE.start_main_~x~0#1| 8) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !(main_~n~0#1 <= main_~a~0#1); {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,697 INFO L272 TraceCheckUtils]: 85: Hoare triple {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5594#true} is VALID [2022-02-20 17:15:25,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-02-20 17:15:25,698 INFO L290 TraceCheckUtils]: 87: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-02-20 17:15:25,698 INFO L290 TraceCheckUtils]: 88: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-02-20 17:15:25,698 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {5594#true} {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #64#return; {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:25,699 INFO L272 TraceCheckUtils]: 90: Hoare triple {5854#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:25,699 INFO L290 TraceCheckUtils]: 91: Hoare triple {5873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:25,699 INFO L290 TraceCheckUtils]: 92: Hoare triple {5877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5595#false} is VALID [2022-02-20 17:15:25,700 INFO L290 TraceCheckUtils]: 93: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-02-20 17:15:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-02-20 17:15:25,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:26,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:26,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89921077] [2022-02-20 17:15:26,086 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:26,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935091801] [2022-02-20 17:15:26,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935091801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:26,087 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:26,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:15:26,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804411428] [2022-02-20 17:15:26,087 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:26,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 94 [2022-02-20 17:15:26,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:26,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:26,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:26,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:26,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:26,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:26,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:15:26,133 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:26,637 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2022-02-20 17:15:26,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:15:26,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 94 [2022-02-20 17:15:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:15:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:15:26,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-02-20 17:15:26,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:26,708 INFO L225 Difference]: With dead ends: 122 [2022-02-20 17:15:26,708 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 17:15:26,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 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-02-20 17:15:26,709 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:26,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:15:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 17:15:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-02-20 17:15:26,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:26,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:26,744 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:26,744 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:26,746 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-02-20 17:15:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-02-20 17:15:26,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:26,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:26,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 120 states. [2022-02-20 17:15:26,747 INFO L87 Difference]: Start difference. First operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 120 states. [2022-02-20 17:15:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:26,749 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-02-20 17:15:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-02-20 17:15:26,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:26,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:26,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:26,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 25 states have call successors, (25), 20 states have call predecessors, (25), 20 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2022-02-20 17:15:26,751 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 94 [2022-02-20 17:15:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:26,752 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2022-02-20 17:15:26,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-02-20 17:15:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 17:15:26,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:26,753 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:26,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:26,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:15:26,967 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2022-02-20 17:15:26,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:26,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722681127] [2022-02-20 17:15:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:26,980 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:26,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828718600] [2022-02-20 17:15:26,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:26,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:26,985 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-02-20 17:15:26,986 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-02-20 17:15:27,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:27,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:27,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:15:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:27,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:27,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {6584#true} assume { :begin_inline_ULTIMATE.init } 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); {6584#true} is VALID [2022-02-20 17:15:27,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {6584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6584#true} is VALID [2022-02-20 17:15:27,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {6584#true} assume !(0 == assume_abort_if_not_~cond#1); {6584#true} is VALID [2022-02-20 17:15:27,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {6584#true} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:27,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !false; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:27,608 INFO L272 TraceCheckUtils]: 5: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,609 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:27,609 INFO L272 TraceCheckUtils]: 10: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,609 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:27,609 INFO L272 TraceCheckUtils]: 15: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,610 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #58#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:27,610 INFO L272 TraceCheckUtils]: 20: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,611 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #60#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:27,611 INFO L272 TraceCheckUtils]: 25: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,631 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6584#true} {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #62#return; {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:27,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {6598#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !false; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,632 INFO L272 TraceCheckUtils]: 32: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,633 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,633 INFO L272 TraceCheckUtils]: 37: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,634 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,634 INFO L272 TraceCheckUtils]: 42: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,635 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #58#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,635 INFO L272 TraceCheckUtils]: 47: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,635 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #60#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,636 INFO L272 TraceCheckUtils]: 52: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,636 INFO L290 TraceCheckUtils]: 55: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,636 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6584#true} {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} #62#return; {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:27,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {6680#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !false; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,638 INFO L272 TraceCheckUtils]: 59: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,638 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #54#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,638 INFO L272 TraceCheckUtils]: 64: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,639 INFO L290 TraceCheckUtils]: 66: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,639 INFO L290 TraceCheckUtils]: 67: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,639 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #56#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,639 INFO L272 TraceCheckUtils]: 69: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,639 INFO L290 TraceCheckUtils]: 70: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,639 INFO L290 TraceCheckUtils]: 71: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,640 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #58#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,640 INFO L272 TraceCheckUtils]: 74: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,640 INFO L290 TraceCheckUtils]: 76: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,640 INFO L290 TraceCheckUtils]: 77: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,640 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #60#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,640 INFO L272 TraceCheckUtils]: 79: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,640 INFO L290 TraceCheckUtils]: 80: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,641 INFO L290 TraceCheckUtils]: 81: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,641 INFO L290 TraceCheckUtils]: 82: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,641 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6584#true} {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #62#return; {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,641 INFO L290 TraceCheckUtils]: 84: Hoare triple {6762#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 1) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} assume !(main_~n~0#1 <= main_~a~0#1); {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,641 INFO L272 TraceCheckUtils]: 85: Hoare triple {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,642 INFO L290 TraceCheckUtils]: 88: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,642 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {6584#true} {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #64#return; {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,642 INFO L272 TraceCheckUtils]: 90: Hoare triple {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6584#true} is VALID [2022-02-20 17:15:27,642 INFO L290 TraceCheckUtils]: 91: Hoare triple {6584#true} ~cond := #in~cond; {6584#true} is VALID [2022-02-20 17:15:27,642 INFO L290 TraceCheckUtils]: 92: Hoare triple {6584#true} assume !(0 == ~cond); {6584#true} is VALID [2022-02-20 17:15:27,642 INFO L290 TraceCheckUtils]: 93: Hoare triple {6584#true} assume true; {6584#true} is VALID [2022-02-20 17:15:27,643 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {6584#true} {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} #66#return; {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} is VALID [2022-02-20 17:15:27,643 INFO L272 TraceCheckUtils]: 95: Hoare triple {6844#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~z~0#1| 1)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (not (<= 2 |ULTIMATE.start_main_~a~0#1|)) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 12))} call __VERIFIER_assert((if 0 == main_~a~0#1 * main_~z~0#1 - 6 * main_~a~0#1 - 2 * main_~y~0#1 + 2 * main_~z~0#1 - 10 then 1 else 0)); {6878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:27,644 INFO L290 TraceCheckUtils]: 96: Hoare triple {6878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:27,644 INFO L290 TraceCheckUtils]: 97: Hoare triple {6882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6585#false} is VALID [2022-02-20 17:15:27,644 INFO L290 TraceCheckUtils]: 98: Hoare triple {6585#false} assume !false; {6585#false} is VALID [2022-02-20 17:15:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-02-20 17:15:27,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:39,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:39,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722681127] [2022-02-20 17:15:39,267 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:39,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828718600] [2022-02-20 17:15:39,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828718600] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:39,267 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:39,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:15:39,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79635091] [2022-02-20 17:15:39,267 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:39,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 99 [2022-02-20 17:15:39,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:39,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:39,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:39,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:39,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:39,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:15:39,310 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:39,775 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 17:15:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:15:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 99 [2022-02-20 17:15:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:15:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 17:15:39,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-02-20 17:15:39,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:39,861 INFO L225 Difference]: With dead ends: 130 [2022-02-20 17:15:39,861 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:15:39,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 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-02-20 17:15:39,862 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:39,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:15:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-20 17:15:39,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:39,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:39,907 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:39,907 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:39,909 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-02-20 17:15:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-02-20 17:15:39,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:39,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:39,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 117 states. [2022-02-20 17:15:39,910 INFO L87 Difference]: Start difference. First operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 117 states. [2022-02-20 17:15:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:39,912 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-02-20 17:15:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-02-20 17:15:39,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:39,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:39,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:39,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 74 states have internal predecessors, (75), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2022-02-20 17:15:39,916 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 99 [2022-02-20 17:15:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:39,917 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2022-02-20 17:15:39,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-02-20 17:15:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-20 17:15:39,918 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:39,918 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:39,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:40,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 17:15:40,135 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 3 times [2022-02-20 17:15:40,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:40,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423271759] [2022-02-20 17:15:40,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:40,144 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:40,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034718690] [2022-02-20 17:15:40,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:15:40,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:40,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:40,164 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-02-20 17:15:40,165 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-02-20 17:15:40,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 17:15:40,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:40,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 17:15:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:40,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:42,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {7604#true} assume { :begin_inline_ULTIMATE.init } 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); {7604#true} is VALID [2022-02-20 17:15:42,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7612#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= 0 |ULTIMATE.start_main_~a~0#1|)) (not (<= |ULTIMATE.start_main_~a~0#1| 10))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:15:42,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {7612#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= 0 |ULTIMATE.start_main_~a~0#1|)) (not (<= |ULTIMATE.start_main_~a~0#1| 10))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,412 INFO L272 TraceCheckUtils]: 5: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,412 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,412 INFO L272 TraceCheckUtils]: 10: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,413 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,413 INFO L272 TraceCheckUtils]: 15: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,414 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,414 INFO L272 TraceCheckUtils]: 20: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,415 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,415 INFO L272 TraceCheckUtils]: 25: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,416 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,417 INFO L272 TraceCheckUtils]: 32: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,417 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,418 INFO L272 TraceCheckUtils]: 37: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,418 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,418 INFO L272 TraceCheckUtils]: 42: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,419 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,419 INFO L272 TraceCheckUtils]: 47: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,420 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,420 INFO L272 TraceCheckUtils]: 52: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,421 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,422 INFO L272 TraceCheckUtils]: 59: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,422 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,422 INFO L272 TraceCheckUtils]: 64: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,423 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,424 INFO L272 TraceCheckUtils]: 69: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,424 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,424 INFO L272 TraceCheckUtils]: 74: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,425 INFO L290 TraceCheckUtils]: 76: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,425 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,425 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,425 INFO L272 TraceCheckUtils]: 79: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,425 INFO L290 TraceCheckUtils]: 80: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,426 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7604#true} {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {7616#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7863#(and (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {7863#(and (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {7863#(and (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,427 INFO L272 TraceCheckUtils]: 86: Hoare triple {7863#(and (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,427 INFO L290 TraceCheckUtils]: 87: Hoare triple {7604#true} ~cond := #in~cond; {7873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:42,428 INFO L290 TraceCheckUtils]: 88: Hoare triple {7873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:42,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:42,428 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {7877#(not (= |__VERIFIER_assert_#in~cond| 0))} {7863#(and (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,428 INFO L272 TraceCheckUtils]: 91: Hoare triple {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,429 INFO L290 TraceCheckUtils]: 92: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,429 INFO L290 TraceCheckUtils]: 93: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,429 INFO L290 TraceCheckUtils]: 94: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,429 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7604#true} {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,429 INFO L272 TraceCheckUtils]: 96: Hoare triple {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,429 INFO L290 TraceCheckUtils]: 97: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,430 INFO L290 TraceCheckUtils]: 98: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,430 INFO L290 TraceCheckUtils]: 99: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,430 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {7604#true} {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,430 INFO L272 TraceCheckUtils]: 101: Hoare triple {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,430 INFO L290 TraceCheckUtils]: 102: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,430 INFO L290 TraceCheckUtils]: 103: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,430 INFO L290 TraceCheckUtils]: 104: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,431 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7604#true} {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,431 INFO L272 TraceCheckUtils]: 106: Hoare triple {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,431 INFO L290 TraceCheckUtils]: 107: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,431 INFO L290 TraceCheckUtils]: 108: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,432 INFO L290 TraceCheckUtils]: 109: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,432 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {7604#true} {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,433 INFO L290 TraceCheckUtils]: 111: Hoare triple {7884#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~n~0#1 <= main_~a~0#1); {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,433 INFO L272 TraceCheckUtils]: 112: Hoare triple {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7604#true} is VALID [2022-02-20 17:15:42,433 INFO L290 TraceCheckUtils]: 113: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-02-20 17:15:42,433 INFO L290 TraceCheckUtils]: 114: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-02-20 17:15:42,434 INFO L290 TraceCheckUtils]: 115: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-02-20 17:15:42,434 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {7604#true} {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #64#return; {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:42,650 INFO L272 TraceCheckUtils]: 117: Hoare triple {7948#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:42,651 INFO L290 TraceCheckUtils]: 118: Hoare triple {7967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:42,651 INFO L290 TraceCheckUtils]: 119: Hoare triple {7971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-02-20 17:15:42,651 INFO L290 TraceCheckUtils]: 120: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-02-20 17:15:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-02-20 17:15:42,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:43,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:43,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423271759] [2022-02-20 17:15:43,964 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:43,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034718690] [2022-02-20 17:15:43,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034718690] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:43,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:43,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:15:43,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84010029] [2022-02-20 17:15:43,964 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 121 [2022-02-20 17:15:43,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:43,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:44,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:44,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:15:44,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:15:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:15:44,096 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:44,603 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2022-02-20 17:15:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:15:44,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 121 [2022-02-20 17:15:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-02-20 17:15:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-02-20 17:15:44,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-02-20 17:15:44,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:44,652 INFO L225 Difference]: With dead ends: 123 [2022-02-20 17:15:44,652 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 17:15:44,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:15:44,653 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:44,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 88 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:15:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 17:15:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-02-20 17:15:44,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:44,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:44,714 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:44,714 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:44,716 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2022-02-20 17:15:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2022-02-20 17:15:44,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:44,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:44,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-02-20 17:15:44,716 INFO L87 Difference]: Start difference. First operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-02-20 17:15:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:44,718 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2022-02-20 17:15:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2022-02-20 17:15:44,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:44,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:44,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:44,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2022-02-20 17:15:44,720 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 121 [2022-02-20 17:15:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:44,720 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2022-02-20 17:15:44,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2022-02-20 17:15:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-20 17:15:44,721 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:44,721 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:44,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-20 17:15:44,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-20 17:15:44,925 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2022-02-20 17:15:44,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:44,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281906806] [2022-02-20 17:15:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:44,935 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:44,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923751482] [2022-02-20 17:15:44,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:15:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:44,937 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-02-20 17:15:44,938 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-02-20 17:15:45,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:15:45,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:45,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-20 17:15:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:45,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:52,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {8579#true} assume { :begin_inline_ULTIMATE.init } 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); {8579#true} is VALID [2022-02-20 17:15:52,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {8579#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~a~0#1 >= 0 && main_~a~0#1 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8587#(and (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= 0 |ULTIMATE.start_main_~a~0#1|)) (not (<= |ULTIMATE.start_main_~a~0#1| 10))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))} is VALID [2022-02-20 17:15:52,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {8587#(and (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (or (not (<= 0 |ULTIMATE.start_main_~a~0#1|)) (not (<= |ULTIMATE.start_main_~a~0#1| 10))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))} assume !(0 == assume_abort_if_not_~cond#1); {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume { :end_inline_assume_abort_if_not } true;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,961 INFO L272 TraceCheckUtils]: 5: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,961 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,961 INFO L272 TraceCheckUtils]: 10: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,962 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,962 INFO L272 TraceCheckUtils]: 15: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,963 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,963 INFO L272 TraceCheckUtils]: 20: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,964 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,964 INFO L272 TraceCheckUtils]: 25: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,964 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,965 INFO L272 TraceCheckUtils]: 32: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,965 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,965 INFO L272 TraceCheckUtils]: 37: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,966 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,966 INFO L272 TraceCheckUtils]: 42: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,966 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,967 INFO L272 TraceCheckUtils]: 47: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,967 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8579#true} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,967 INFO L272 TraceCheckUtils]: 52: Hoare triple {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {8579#true} ~cond := #in~cond; {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:52,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:52,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:52,968 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} {8591#(and (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,971 INFO L290 TraceCheckUtils]: 58: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,971 INFO L272 TraceCheckUtils]: 59: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,971 INFO L290 TraceCheckUtils]: 62: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,971 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,971 INFO L272 TraceCheckUtils]: 64: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,972 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,972 INFO L272 TraceCheckUtils]: 69: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,972 INFO L290 TraceCheckUtils]: 71: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,972 INFO L290 TraceCheckUtils]: 72: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,973 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,973 INFO L272 TraceCheckUtils]: 74: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,973 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8579#true} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,974 INFO L272 TraceCheckUtils]: 79: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {8579#true} ~cond := #in~cond; {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:52,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:52,983 INFO L290 TraceCheckUtils]: 82: Hoare triple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:52,984 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {8756#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,986 INFO L290 TraceCheckUtils]: 85: Hoare triple {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,986 INFO L272 TraceCheckUtils]: 86: Hoare triple {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {8579#true} ~cond := #in~cond; {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:52,987 INFO L290 TraceCheckUtils]: 88: Hoare triple {8745#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:52,987 INFO L290 TraceCheckUtils]: 89: Hoare triple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:52,987 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {8749#(not (= |__VERIFIER_assert_#in~cond| 0))} {8841#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,988 INFO L272 TraceCheckUtils]: 91: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,988 INFO L290 TraceCheckUtils]: 92: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,988 INFO L290 TraceCheckUtils]: 93: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,988 INFO L290 TraceCheckUtils]: 94: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,988 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,988 INFO L272 TraceCheckUtils]: 96: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,988 INFO L290 TraceCheckUtils]: 99: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,989 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,989 INFO L272 TraceCheckUtils]: 101: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,989 INFO L290 TraceCheckUtils]: 102: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,989 INFO L290 TraceCheckUtils]: 103: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,989 INFO L290 TraceCheckUtils]: 104: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,989 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,990 INFO L272 TraceCheckUtils]: 106: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,990 INFO L290 TraceCheckUtils]: 107: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,990 INFO L290 TraceCheckUtils]: 108: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,990 INFO L290 TraceCheckUtils]: 109: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,990 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {8579#true} {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,991 INFO L290 TraceCheckUtils]: 111: Hoare triple {8860#(and (= (+ (* |ULTIMATE.start_main_~y~0#1| 12) 36 (* |ULTIMATE.start_main_~z~0#1| (- 6))) (+ (* (+ |ULTIMATE.start_main_~z~0#1| (- 6)) (+ |ULTIMATE.start_main_~z~0#1| (- 6))) 12)) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~n~0#1 <= main_~a~0#1); {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,991 INFO L272 TraceCheckUtils]: 112: Hoare triple {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,991 INFO L290 TraceCheckUtils]: 113: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,991 INFO L290 TraceCheckUtils]: 114: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,991 INFO L290 TraceCheckUtils]: 115: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,992 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {8579#true} {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #64#return; {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:52,992 INFO L272 TraceCheckUtils]: 117: Hoare triple {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {8579#true} is VALID [2022-02-20 17:15:52,992 INFO L290 TraceCheckUtils]: 118: Hoare triple {8579#true} ~cond := #in~cond; {8579#true} is VALID [2022-02-20 17:15:52,992 INFO L290 TraceCheckUtils]: 119: Hoare triple {8579#true} assume !(0 == ~cond); {8579#true} is VALID [2022-02-20 17:15:52,992 INFO L290 TraceCheckUtils]: 120: Hoare triple {8579#true} assume true; {8579#true} is VALID [2022-02-20 17:15:52,992 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {8579#true} {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #66#return; {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:53,762 INFO L272 TraceCheckUtils]: 122: Hoare triple {8924#(and (= (+ 12 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~y~0#1| 12) (* 6 |ULTIMATE.start_main_~z~0#1|))) (< |ULTIMATE.start_main_~a~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (<= |ULTIMATE.start_main_~a~0#1| 10) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~a~0#1 * main_~z~0#1 - 6 * main_~a~0#1 - 2 * main_~y~0#1 + 2 * main_~z~0#1 - 10 then 1 else 0)); {8958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:53,763 INFO L290 TraceCheckUtils]: 123: Hoare triple {8958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:53,763 INFO L290 TraceCheckUtils]: 124: Hoare triple {8962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8580#false} is VALID [2022-02-20 17:15:53,763 INFO L290 TraceCheckUtils]: 125: Hoare triple {8580#false} assume !false; {8580#false} is VALID [2022-02-20 17:15:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-02-20 17:15:53,764 INFO L328 TraceCheckSpWp]: Computing backward predicates...