./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/ps6-ll.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/ps6-ll.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 86799fe5f850b9662e00c059510821f75e69d50f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:16:41,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:16:41,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:16:42,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:16:42,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:16:42,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:16:42,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:16:42,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:16:42,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:16:42,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:16:42,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:16:42,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:16:42,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:16:42,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:16:42,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:16:42,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:16:42,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:16:42,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:16:42,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:16:42,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:16:42,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:16:42,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:16:42,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:16:42,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:16:42,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:16:42,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:16:42,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:16:42,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:16:42,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:16:42,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:16:42,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:16:42,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:16:42,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:16:42,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:16:42,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:16:42,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:16:42,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:16:42,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:16:42,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:16:42,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:16:42,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:16:42,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:16:42,133 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:16:42,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:16:42,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:16:42,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:16:42,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:16:42,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:16:42,137 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:16:42,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:16:42,138 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:16:42,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:16:42,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:16:42,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:16:42,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:16:42,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:16:42,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:16:42,140 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:16:42,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:16:42,140 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:16:42,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:16:42,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:16:42,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:16:42,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:16:42,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:16:42,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:16:42,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:16:42,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:16:42,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:16:42,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:16:42,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:16:42,150 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:16:42,150 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 -> 86799fe5f850b9662e00c059510821f75e69d50f [2021-09-13 14:16:42,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:16:42,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:16:42,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:16:42,516 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:16:42,517 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:16:42,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/ps6-ll.c [2021-09-13 14:16:42,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5256ef81e/9b9a547c3a2f46e9b9637eb8cfeb5614/FLAG115000d55 [2021-09-13 14:16:43,021 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:16:43,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/ps6-ll.c [2021-09-13 14:16:43,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5256ef81e/9b9a547c3a2f46e9b9637eb8cfeb5614/FLAG115000d55 [2021-09-13 14:16:43,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5256ef81e/9b9a547c3a2f46e9b9637eb8cfeb5614 [2021-09-13 14:16:43,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:16:43,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:16:43,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:16:43,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:16:43,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:16:43,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b71ac22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43, skipping insertion in model container [2021-09-13 14:16:43,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:16:43,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:16:43,195 WARN L228 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/ps6-ll.c[458,471] [2021-09-13 14:16:43,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:16:43,221 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:16:43,234 WARN L228 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/ps6-ll.c[458,471] [2021-09-13 14:16:43,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:16:43,281 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:16:43,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43 WrapperNode [2021-09-13 14:16:43,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:16:43,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:16:43,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:16:43,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:16:43,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:16:43,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:16:43,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:16:43,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:16:43,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:16:43,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:16:43,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:16:43,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:16:43,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (1/1) ... [2021-09-13 14:16:43,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:16:43,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:43,362 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) [2021-09-13 14:16:43,387 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 [2021-09-13 14:16:43,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:16:43,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:16:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:16:43,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:16:43,603 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:16:43,604 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-09-13 14:16:43,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:16:43 BoogieIcfgContainer [2021-09-13 14:16:43,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:16:43,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:16:43,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:16:43,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:16:43,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:16:43" (1/3) ... [2021-09-13 14:16:43,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5814d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:16:43, skipping insertion in model container [2021-09-13 14:16:43,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:43" (2/3) ... [2021-09-13 14:16:43,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5814d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:16:43, skipping insertion in model container [2021-09-13 14:16:43,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:16:43" (3/3) ... [2021-09-13 14:16:43,612 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2021-09-13 14:16:43,616 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:16:43,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-09-13 14:16:43,660 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:16:43,666 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-09-13 14:16:43,666 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-09-13 14:16:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:16:43,683 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:43,684 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:43,686 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:43,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-09-13 14:16:43,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:43,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294164626] [2021-09-13 14:16:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:43,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:43,881 INFO L281 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {24#true} is VALID [2021-09-13 14:16:43,894 INFO L281 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {24#true} is VALID [2021-09-13 14:16:43,895 INFO L281 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 14:16:43,895 INFO L281 TraceCheckUtils]: 3: Hoare triple {25#false} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {25#false} is VALID [2021-09-13 14:16:43,895 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#false} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2021-09-13 14:16:43,896 INFO L281 TraceCheckUtils]: 5: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond; {25#false} is VALID [2021-09-13 14:16:43,896 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#false} assume !false; {25#false} is VALID [2021-09-13 14:16:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:43,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:43,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294164626] [2021-09-13 14:16:43,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294164626] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:16:43,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:16:43,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:16:43,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244156949] [2021-09-13 14:16:43,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:16:43,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:43,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:43,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:43,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:16:43,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:16:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:16:43,965 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:44,095 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2021-09-13 14:16:44,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:16:44,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:16:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2021-09-13 14:16:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2021-09-13 14:16:44,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2021-09-13 14:16:44,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:44,184 INFO L225 Difference]: With dead ends: 39 [2021-09-13 14:16:44,184 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 14:16:44,187 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:16:44,190 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.99ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:44,192 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 40.99ms Time] [2021-09-13 14:16:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 14:16:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-09-13 14:16:44,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:44,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,215 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,216 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:44,218 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2021-09-13 14:16:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:16:44,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:44,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:44,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2021-09-13 14:16:44,219 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2021-09-13 14:16:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:44,221 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2021-09-13 14:16:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:16:44,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:44,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:44,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:44,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-09-13 14:16:44,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2021-09-13 14:16:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:44,225 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-09-13 14:16:44,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:16:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:16:44,226 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:44,226 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:44,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:16:44,227 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-09-13 14:16:44,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:44,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316494798] [2021-09-13 14:16:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:44,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:44,239 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:44,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113798990] [2021-09-13 14:16:44,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:44,240 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:44,242 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) [2021-09-13 14:16:44,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:16:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:44,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:16:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:44,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:44,529 INFO L281 TraceCheckUtils]: 0: Hoare triple {131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {131#true} is VALID [2021-09-13 14:16:44,530 INFO L281 TraceCheckUtils]: 1: Hoare triple {131#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {131#true} is VALID [2021-09-13 14:16:44,530 INFO L281 TraceCheckUtils]: 2: Hoare triple {131#true} assume !(0 == assume_abort_if_not_~cond); {131#true} is VALID [2021-09-13 14:16:44,531 INFO L281 TraceCheckUtils]: 3: Hoare triple {131#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {145#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:44,533 INFO L281 TraceCheckUtils]: 4: Hoare triple {145#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {149#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:44,534 INFO L281 TraceCheckUtils]: 5: Hoare triple {149#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {132#false} is VALID [2021-09-13 14:16:44,534 INFO L281 TraceCheckUtils]: 6: Hoare triple {132#false} assume !false; {132#false} is VALID [2021-09-13 14:16:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:44,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:16:44,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:44,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316494798] [2021-09-13 14:16:44,543 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:44,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113798990] [2021-09-13 14:16:44,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113798990] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:16:44,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:16:44,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:16:44,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061646076] [2021-09-13 14:16:44,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:16:44,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:44,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:44,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:44,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:16:44,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:44,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:16:44,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:16:44,562 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:45,569 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2021-09-13 14:16:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:16:45,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:16:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:16:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:16:45,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2021-09-13 14:16:45,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:45,605 INFO L225 Difference]: With dead ends: 31 [2021-09-13 14:16:45,606 INFO L226 Difference]: Without dead ends: 21 [2021-09-13 14:16:45,606 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.29ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:16:45,607 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 903.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.09ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 906.19ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:45,608 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 1.09ms Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 906.19ms Time] [2021-09-13 14:16:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-09-13 14:16:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-09-13 14:16:45,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:45,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,619 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,619 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:45,620 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-09-13 14:16:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-09-13 14:16:45,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:45,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:45,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:16:45,622 INFO L87 Difference]: Start difference. First operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:16:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:45,623 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-09-13 14:16:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-09-13 14:16:45,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:45,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:45,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:45,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-09-13 14:16:45,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2021-09-13 14:16:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:45,626 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-09-13 14:16:45,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-09-13 14:16:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:16:45,627 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:45,627 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:45,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-09-13 14:16:45,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:45,841 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1864186656, now seen corresponding path program 1 times [2021-09-13 14:16:45,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:45,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540019151] [2021-09-13 14:16:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:45,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:45,856 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:45,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327650790] [2021-09-13 14:16:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:45,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:45,862 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) [2021-09-13 14:16:45,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:16:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:45,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:16:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:45,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:46,132 INFO L281 TraceCheckUtils]: 0: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {262#true} is VALID [2021-09-13 14:16:46,132 INFO L281 TraceCheckUtils]: 1: Hoare triple {262#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {262#true} is VALID [2021-09-13 14:16:46,133 INFO L281 TraceCheckUtils]: 2: Hoare triple {262#true} assume !(0 == assume_abort_if_not_~cond); {262#true} is VALID [2021-09-13 14:16:46,133 INFO L281 TraceCheckUtils]: 3: Hoare triple {262#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:46,134 INFO L281 TraceCheckUtils]: 4: Hoare triple {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:46,135 INFO L281 TraceCheckUtils]: 5: Hoare triple {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !(0 == __VERIFIER_assert_~cond); {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:46,135 INFO L281 TraceCheckUtils]: 6: Hoare triple {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {286#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:16:46,137 INFO L281 TraceCheckUtils]: 7: Hoare triple {286#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:46,138 INFO L281 TraceCheckUtils]: 8: Hoare triple {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {263#false} is VALID [2021-09-13 14:16:46,138 INFO L281 TraceCheckUtils]: 9: Hoare triple {263#false} assume !false; {263#false} is VALID [2021-09-13 14:16:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:46,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:46,321 INFO L281 TraceCheckUtils]: 9: Hoare triple {263#false} assume !false; {263#false} is VALID [2021-09-13 14:16:46,323 INFO L281 TraceCheckUtils]: 8: Hoare triple {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {263#false} is VALID [2021-09-13 14:16:46,323 INFO L281 TraceCheckUtils]: 7: Hoare triple {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:50,165 INFO L281 TraceCheckUtils]: 6: Hoare triple {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} is UNKNOWN [2021-09-13 14:16:50,166 INFO L281 TraceCheckUtils]: 5: Hoare triple {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} assume !(0 == __VERIFIER_assert_~cond); {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:16:50,166 INFO L281 TraceCheckUtils]: 4: Hoare triple {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:16:50,167 INFO L281 TraceCheckUtils]: 3: Hoare triple {262#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {303#(= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:16:50,167 INFO L281 TraceCheckUtils]: 2: Hoare triple {262#true} assume !(0 == assume_abort_if_not_~cond); {262#true} is VALID [2021-09-13 14:16:50,167 INFO L281 TraceCheckUtils]: 1: Hoare triple {262#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {262#true} is VALID [2021-09-13 14:16:50,167 INFO L281 TraceCheckUtils]: 0: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {262#true} is VALID [2021-09-13 14:16:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:16:50,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:50,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540019151] [2021-09-13 14:16:50,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:50,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327650790] [2021-09-13 14:16:50,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327650790] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:50,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:50,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-09-13 14:16:50,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931767517] [2021-09-13 14:16:50,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:16:50,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:50,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:54,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:54,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:16:54,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:16:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:16:54,084 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:54,292 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-09-13 14:16:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:16:54,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:16:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2021-09-13 14:16:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2021-09-13 14:16:54,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2021-09-13 14:16:58,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:58,160 INFO L225 Difference]: With dead ends: 29 [2021-09-13 14:16:58,160 INFO L226 Difference]: Without dead ends: 25 [2021-09-13 14:16:58,160 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.86ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:16:58,161 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.26ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.62ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:58,162 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 1.26ms Time], IncrementalHoareTripleChecker [14 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 79.62ms Time] [2021-09-13 14:16:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-09-13 14:16:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-09-13 14:16:58,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:58,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:58,177 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:58,177 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:58,185 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2021-09-13 14:16:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2021-09-13 14:16:58,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:58,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:58,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2021-09-13 14:16:58,186 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2021-09-13 14:16:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:58,187 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2021-09-13 14:16:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2021-09-13 14:16:58,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:58,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:58,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:58,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-09-13 14:16:58,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2021-09-13 14:16:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:58,190 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-09-13 14:16:58,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-09-13 14:16:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:16:58,191 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:58,191 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:58,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:16:58,404 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,SelfDestructingSolverStorable2 [2021-09-13 14:16:58,405 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1195783865, now seen corresponding path program 1 times [2021-09-13 14:16:58,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:58,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374476416] [2021-09-13 14:16:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:58,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:58,427 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:58,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287899306] [2021-09-13 14:16:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:58,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:58,446 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) [2021-09-13 14:16:58,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:16:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:58,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:16:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:58,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:58,860 INFO L281 TraceCheckUtils]: 0: Hoare triple {438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {438#true} is VALID [2021-09-13 14:16:58,861 INFO L281 TraceCheckUtils]: 1: Hoare triple {438#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {438#true} is VALID [2021-09-13 14:16:58,861 INFO L281 TraceCheckUtils]: 2: Hoare triple {438#true} assume !(0 == assume_abort_if_not_~cond); {438#true} is VALID [2021-09-13 14:16:58,862 INFO L281 TraceCheckUtils]: 3: Hoare triple {438#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {452#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:58,862 INFO L281 TraceCheckUtils]: 4: Hoare triple {452#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {452#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:58,863 INFO L281 TraceCheckUtils]: 5: Hoare triple {452#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {452#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:58,864 INFO L281 TraceCheckUtils]: 6: Hoare triple {452#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {462#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:58,864 INFO L281 TraceCheckUtils]: 7: Hoare triple {462#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {462#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:58,865 INFO L281 TraceCheckUtils]: 8: Hoare triple {462#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {462#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:58,865 INFO L281 TraceCheckUtils]: 9: Hoare triple {462#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !(main_~c~0 < main_~k~0); {472#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} is VALID [2021-09-13 14:16:58,866 INFO L281 TraceCheckUtils]: 10: Hoare triple {472#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} __VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {472#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} is VALID [2021-09-13 14:16:58,866 INFO L281 TraceCheckUtils]: 11: Hoare triple {472#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} assume !(0 == __VERIFIER_assert_~cond); {472#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} is VALID [2021-09-13 14:16:58,867 INFO L281 TraceCheckUtils]: 12: Hoare triple {472#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} __VERIFIER_assert_#in~cond := (if main_~k~0 * main_~y~0 == main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:58,868 INFO L281 TraceCheckUtils]: 13: Hoare triple {482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {439#false} is VALID [2021-09-13 14:16:58,868 INFO L281 TraceCheckUtils]: 14: Hoare triple {439#false} assume !false; {439#false} is VALID [2021-09-13 14:16:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:58,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:59,604 INFO L281 TraceCheckUtils]: 14: Hoare triple {439#false} assume !false; {439#false} is VALID [2021-09-13 14:16:59,605 INFO L281 TraceCheckUtils]: 13: Hoare triple {482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {439#false} is VALID [2021-09-13 14:16:59,608 INFO L281 TraceCheckUtils]: 12: Hoare triple {495#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~k~0 * main_~y~0 == main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:59,608 INFO L281 TraceCheckUtils]: 11: Hoare triple {495#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {495#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:16:59,608 INFO L281 TraceCheckUtils]: 10: Hoare triple {495#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {495#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:16:59,609 INFO L281 TraceCheckUtils]: 9: Hoare triple {505#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {495#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:16:59,609 INFO L281 TraceCheckUtils]: 8: Hoare triple {505#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {505#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:59,611 INFO L281 TraceCheckUtils]: 7: Hoare triple {505#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {505#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:59,630 INFO L281 TraceCheckUtils]: 6: Hoare triple {515#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {505#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:59,630 INFO L281 TraceCheckUtils]: 5: Hoare triple {515#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !(0 == __VERIFIER_assert_~cond); {515#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:59,631 INFO L281 TraceCheckUtils]: 4: Hoare triple {515#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {515#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:59,631 INFO L281 TraceCheckUtils]: 3: Hoare triple {438#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {515#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:59,632 INFO L281 TraceCheckUtils]: 2: Hoare triple {438#true} assume !(0 == assume_abort_if_not_~cond); {438#true} is VALID [2021-09-13 14:16:59,632 INFO L281 TraceCheckUtils]: 1: Hoare triple {438#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {438#true} is VALID [2021-09-13 14:16:59,632 INFO L281 TraceCheckUtils]: 0: Hoare triple {438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {438#true} is VALID [2021-09-13 14:16:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:59,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:59,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374476416] [2021-09-13 14:16:59,633 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:59,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287899306] [2021-09-13 14:16:59,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287899306] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:59,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:59,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:16:59,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380641922] [2021-09-13 14:16:59,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-13 14:16:59,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:59,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:59,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:16:59,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:59,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:16:59,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:16:59,686 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:59,931 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2021-09-13 14:16:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:16:59,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-13 14:16:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2021-09-13 14:16:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2021-09-13 14:16:59,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2021-09-13 14:16:59,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:59,959 INFO L225 Difference]: With dead ends: 25 [2021-09-13 14:16:59,959 INFO L226 Difference]: Without dead ends: 19 [2021-09-13 14:16:59,960 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 132.44ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:16:59,960 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.28ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 109.97ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:59,961 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 104 Unknown, 0 Unchecked, 1.28ms Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 17 Unchecked, 109.97ms Time] [2021-09-13 14:16:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-09-13 14:16:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-09-13 14:16:59,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:59,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,981 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,981 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:59,982 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-09-13 14:16:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-09-13 14:16:59,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:59,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:59,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2021-09-13 14:16:59,983 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2021-09-13 14:16:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:59,984 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-09-13 14:16:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-09-13 14:16:59,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:59,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:59,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:59,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2021-09-13 14:16:59,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2021-09-13 14:16:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:59,987 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2021-09-13 14:16:59,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-09-13 14:16:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:16:59,987 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:59,988 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:00,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:00,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:00,197 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:17:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 605515000, now seen corresponding path program 2 times [2021-09-13 14:17:00,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:00,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946366437] [2021-09-13 14:17:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:00,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:00,207 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:00,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750623284] [2021-09-13 14:17:00,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:17:00,207 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:00,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:00,225 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) [2021-09-13 14:17:00,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:17:00,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:17:00,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:17:00,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:17:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:00,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:00,761 INFO L281 TraceCheckUtils]: 0: Hoare triple {634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {634#true} is VALID [2021-09-13 14:17:00,761 INFO L281 TraceCheckUtils]: 1: Hoare triple {634#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {634#true} is VALID [2021-09-13 14:17:00,762 INFO L281 TraceCheckUtils]: 2: Hoare triple {634#true} assume !(0 == assume_abort_if_not_~cond); {634#true} is VALID [2021-09-13 14:17:00,771 INFO L281 TraceCheckUtils]: 3: Hoare triple {634#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {648#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:17:00,772 INFO L281 TraceCheckUtils]: 4: Hoare triple {648#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {648#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:17:00,772 INFO L281 TraceCheckUtils]: 5: Hoare triple {648#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {648#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:17:00,773 INFO L281 TraceCheckUtils]: 6: Hoare triple {648#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {658#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:17:00,773 INFO L281 TraceCheckUtils]: 7: Hoare triple {658#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {658#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:17:00,774 INFO L281 TraceCheckUtils]: 8: Hoare triple {658#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {658#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:17:00,774 INFO L281 TraceCheckUtils]: 9: Hoare triple {658#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {668#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:00,775 INFO L281 TraceCheckUtils]: 10: Hoare triple {668#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {668#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:00,775 INFO L281 TraceCheckUtils]: 11: Hoare triple {668#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !(0 == __VERIFIER_assert_~cond); {668#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:00,777 INFO L281 TraceCheckUtils]: 12: Hoare triple {668#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !(main_~c~0 < main_~k~0); {678#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:00,777 INFO L281 TraceCheckUtils]: 13: Hoare triple {678#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} __VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {678#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:00,778 INFO L281 TraceCheckUtils]: 14: Hoare triple {678#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !(0 == __VERIFIER_assert_~cond); {678#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:00,778 INFO L281 TraceCheckUtils]: 15: Hoare triple {678#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} __VERIFIER_assert_#in~cond := (if main_~k~0 * main_~y~0 == main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {688#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:00,779 INFO L281 TraceCheckUtils]: 16: Hoare triple {688#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {635#false} is VALID [2021-09-13 14:17:00,779 INFO L281 TraceCheckUtils]: 17: Hoare triple {635#false} assume !false; {635#false} is VALID [2021-09-13 14:17:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:00,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:17:01,745 INFO L281 TraceCheckUtils]: 17: Hoare triple {635#false} assume !false; {635#false} is VALID [2021-09-13 14:17:01,745 INFO L281 TraceCheckUtils]: 16: Hoare triple {688#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {635#false} is VALID [2021-09-13 14:17:01,746 INFO L281 TraceCheckUtils]: 15: Hoare triple {701#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~k~0 * main_~y~0 == main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {688#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:01,746 INFO L281 TraceCheckUtils]: 14: Hoare triple {701#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {701#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:01,747 INFO L281 TraceCheckUtils]: 13: Hoare triple {701#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {701#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:01,747 INFO L281 TraceCheckUtils]: 12: Hoare triple {711#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {701#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:01,748 INFO L281 TraceCheckUtils]: 11: Hoare triple {711#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {711#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:01,748 INFO L281 TraceCheckUtils]: 10: Hoare triple {711#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {711#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:01,772 INFO L281 TraceCheckUtils]: 9: Hoare triple {721#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {711#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:01,773 INFO L281 TraceCheckUtils]: 8: Hoare triple {721#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !(0 == __VERIFIER_assert_~cond); {721#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:17:01,773 INFO L281 TraceCheckUtils]: 7: Hoare triple {721#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {721#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:17:01,779 INFO L281 TraceCheckUtils]: 6: Hoare triple {731#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {721#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:17:01,780 INFO L281 TraceCheckUtils]: 5: Hoare triple {731#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !(0 == __VERIFIER_assert_~cond); {731#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:17:01,780 INFO L281 TraceCheckUtils]: 4: Hoare triple {731#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {731#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:17:01,781 INFO L281 TraceCheckUtils]: 3: Hoare triple {634#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {731#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:17:01,781 INFO L281 TraceCheckUtils]: 2: Hoare triple {634#true} assume !(0 == assume_abort_if_not_~cond); {634#true} is VALID [2021-09-13 14:17:01,782 INFO L281 TraceCheckUtils]: 1: Hoare triple {634#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {634#true} is VALID [2021-09-13 14:17:01,782 INFO L281 TraceCheckUtils]: 0: Hoare triple {634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {634#true} is VALID [2021-09-13 14:17:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:01,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:01,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946366437] [2021-09-13 14:17:01,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:01,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750623284] [2021-09-13 14:17:01,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750623284] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:17:01,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:17:01,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-09-13 14:17:01,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862351454] [2021-09-13 14:17:01,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 14:17:01,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:01,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:01,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:01,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 14:17:01,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 14:17:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:17:01,835 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:02,272 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-09-13 14:17:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:17:02,272 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 14:17:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2021-09-13 14:17:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2021-09-13 14:17:02,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2021-09-13 14:17:02,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:02,448 INFO L225 Difference]: With dead ends: 38 [2021-09-13 14:17:02,449 INFO L226 Difference]: Without dead ends: 28 [2021-09-13 14:17:02,449 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 302.55ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:17:02,450 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.62ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 112.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:02,450 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 127 Unknown, 0 Unchecked, 1.62ms Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 38 Unchecked, 112.28ms Time] [2021-09-13 14:17:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-09-13 14:17:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-09-13 14:17:02,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:02,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,497 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,497 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:02,498 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2021-09-13 14:17:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2021-09-13 14:17:02,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:02,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:02,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2021-09-13 14:17:02,499 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2021-09-13 14:17:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:02,500 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2021-09-13 14:17:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2021-09-13 14:17:02,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:02,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:02,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:02,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2021-09-13 14:17:02,501 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 18 [2021-09-13 14:17:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:02,502 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2021-09-13 14:17:02,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2021-09-13 14:17:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-09-13 14:17:02,503 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:02,503 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:02,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:02,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:02,709 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:17:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash -40194553, now seen corresponding path program 3 times [2021-09-13 14:17:02,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:02,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122125754] [2021-09-13 14:17:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:02,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:02,716 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:02,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125005193] [2021-09-13 14:17:02,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:17:02,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:02,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:02,719 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) [2021-09-13 14:17:02,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:17:02,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-09-13 14:17:02,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:17:02,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2021-09-13 14:17:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:02,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:03,996 INFO L281 TraceCheckUtils]: 0: Hoare triple {911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {911#true} is VALID [2021-09-13 14:17:03,997 INFO L281 TraceCheckUtils]: 1: Hoare triple {911#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {911#true} is VALID [2021-09-13 14:17:03,997 INFO L281 TraceCheckUtils]: 2: Hoare triple {911#true} assume !(0 == assume_abort_if_not_~cond); {911#true} is VALID [2021-09-13 14:17:03,997 INFO L281 TraceCheckUtils]: 3: Hoare triple {911#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {925#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:17:03,998 INFO L281 TraceCheckUtils]: 4: Hoare triple {925#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {925#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:17:03,999 INFO L281 TraceCheckUtils]: 5: Hoare triple {925#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {925#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:17:03,999 INFO L281 TraceCheckUtils]: 6: Hoare triple {925#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {935#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:17:04,000 INFO L281 TraceCheckUtils]: 7: Hoare triple {935#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {935#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:17:04,001 INFO L281 TraceCheckUtils]: 8: Hoare triple {935#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} assume !(0 == __VERIFIER_assert_~cond); {935#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:17:04,001 INFO L281 TraceCheckUtils]: 9: Hoare triple {935#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {945#(and (= ULTIMATE.start_main_~c~0 2) (= (+ (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 ULTIMATE.start_main_~y~0)) (+ (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0 (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1)) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:04,002 INFO L281 TraceCheckUtils]: 10: Hoare triple {945#(and (= ULTIMATE.start_main_~c~0 2) (= (+ (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 ULTIMATE.start_main_~y~0)) (+ (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0 (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1)) (= ULTIMATE.start_main_~y~0 2))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {945#(and (= ULTIMATE.start_main_~c~0 2) (= (+ (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 ULTIMATE.start_main_~y~0)) (+ (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0 (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1)) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:04,003 INFO L281 TraceCheckUtils]: 11: Hoare triple {945#(and (= ULTIMATE.start_main_~c~0 2) (= (+ (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 ULTIMATE.start_main_~y~0)) (+ (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0 (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1)) (= ULTIMATE.start_main_~y~0 2))} assume !(0 == __VERIFIER_assert_~cond); {945#(and (= ULTIMATE.start_main_~c~0 2) (= (+ (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 ULTIMATE.start_main_~y~0)) (+ (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0 (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1)) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:17:04,004 INFO L281 TraceCheckUtils]: 12: Hoare triple {945#(and (= ULTIMATE.start_main_~c~0 2) (= (+ (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 ULTIMATE.start_main_~y~0)) (+ (* 10 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0 (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1)) (= ULTIMATE.start_main_~y~0 2))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {955#(and (= (+ (* 50 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 85 ULTIMATE.start_main_~y~0) (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ ULTIMATE.start_main_~x~0 (* 90 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 33 (* 15 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:17:04,005 INFO L281 TraceCheckUtils]: 13: Hoare triple {955#(and (= (+ (* 50 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 85 ULTIMATE.start_main_~y~0) (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ ULTIMATE.start_main_~x~0 (* 90 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 33 (* 15 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {955#(and (= (+ (* 50 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 85 ULTIMATE.start_main_~y~0) (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ ULTIMATE.start_main_~x~0 (* 90 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 33 (* 15 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:17:04,005 INFO L281 TraceCheckUtils]: 14: Hoare triple {955#(and (= (+ (* 50 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 85 ULTIMATE.start_main_~y~0) (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ ULTIMATE.start_main_~x~0 (* 90 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 33 (* 15 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !(0 == __VERIFIER_assert_~cond); {955#(and (= (+ (* 50 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 85 ULTIMATE.start_main_~y~0) (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ ULTIMATE.start_main_~x~0 (* 90 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 33 (* 15 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:17:04,006 INFO L281 TraceCheckUtils]: 15: Hoare triple {955#(and (= (+ (* 50 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 85 ULTIMATE.start_main_~y~0) (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ ULTIMATE.start_main_~x~0 (* 90 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 33 (* 15 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {965#(and (= ULTIMATE.start_main_~x~0 (+ 276 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:17:04,007 INFO L281 TraceCheckUtils]: 16: Hoare triple {965#(and (= ULTIMATE.start_main_~x~0 (+ 276 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {965#(and (= ULTIMATE.start_main_~x~0 (+ 276 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:17:04,007 INFO L281 TraceCheckUtils]: 17: Hoare triple {965#(and (= ULTIMATE.start_main_~x~0 (+ 276 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !(0 == __VERIFIER_assert_~cond); {965#(and (= ULTIMATE.start_main_~x~0 (+ 276 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:17:04,008 INFO L281 TraceCheckUtils]: 18: Hoare triple {965#(and (= ULTIMATE.start_main_~x~0 (+ 276 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {975#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:17:04,009 INFO L281 TraceCheckUtils]: 19: Hoare triple {975#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {975#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:17:04,009 INFO L281 TraceCheckUtils]: 20: Hoare triple {975#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} assume !(0 == __VERIFIER_assert_~cond); {975#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:17:04,010 INFO L281 TraceCheckUtils]: 21: Hoare triple {975#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} assume !(main_~c~0 < main_~k~0); {985#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:17:04,011 INFO L281 TraceCheckUtils]: 22: Hoare triple {985#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5) (= ULTIMATE.start_main_~x~0 (+ 1300 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))))} __VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {989#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~k~0 5))} is VALID [2021-09-13 14:17:04,011 INFO L281 TraceCheckUtils]: 23: Hoare triple {989#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~k~0 5))} assume !(0 == __VERIFIER_assert_~cond); {993#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5))} is VALID [2021-09-13 14:17:04,012 INFO L281 TraceCheckUtils]: 24: Hoare triple {993#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5))} __VERIFIER_assert_#in~cond := (if main_~k~0 * main_~y~0 == main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {997#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:04,012 INFO L281 TraceCheckUtils]: 25: Hoare triple {997#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {912#false} is VALID [2021-09-13 14:17:04,013 INFO L281 TraceCheckUtils]: 26: Hoare triple {912#false} assume !false; {912#false} is VALID [2021-09-13 14:17:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:04,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:17:09,547 INFO L281 TraceCheckUtils]: 26: Hoare triple {912#false} assume !false; {912#false} is VALID [2021-09-13 14:17:09,548 INFO L281 TraceCheckUtils]: 25: Hoare triple {997#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {912#false} is VALID [2021-09-13 14:17:09,548 INFO L281 TraceCheckUtils]: 24: Hoare triple {1010#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~k~0 * main_~y~0 == main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {997#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:09,549 INFO L281 TraceCheckUtils]: 23: Hoare triple {1014#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {1010#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:09,549 INFO L281 TraceCheckUtils]: 22: Hoare triple {1018#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1014#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:17:09,550 INFO L281 TraceCheckUtils]: 21: Hoare triple {1022#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {1018#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:17:09,550 INFO L281 TraceCheckUtils]: 20: Hoare triple {1022#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {1022#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:09,551 INFO L281 TraceCheckUtils]: 19: Hoare triple {1022#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1022#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:09,867 INFO L281 TraceCheckUtils]: 18: Hoare triple {1032#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {1022#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:09,868 INFO L281 TraceCheckUtils]: 17: Hoare triple {1032#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {1032#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:17:09,869 INFO L281 TraceCheckUtils]: 16: Hoare triple {1032#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1032#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:17:12,219 INFO L281 TraceCheckUtils]: 15: Hoare triple {1042#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {1032#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} is UNKNOWN [2021-09-13 14:17:12,220 INFO L281 TraceCheckUtils]: 14: Hoare triple {1042#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {1042#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:17:12,220 INFO L281 TraceCheckUtils]: 13: Hoare triple {1042#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1042#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:17:15,178 INFO L281 TraceCheckUtils]: 12: Hoare triple {1052#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {1042#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))))} is UNKNOWN [2021-09-13 14:17:15,178 INFO L281 TraceCheckUtils]: 11: Hoare triple {1052#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} assume !(0 == __VERIFIER_assert_~cond); {1052#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} is VALID [2021-09-13 14:17:15,179 INFO L281 TraceCheckUtils]: 10: Hoare triple {1052#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1052#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} is VALID [2021-09-13 14:17:17,180 INFO L281 TraceCheckUtils]: 9: Hoare triple {1062#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {1052#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} is UNKNOWN [2021-09-13 14:17:17,181 INFO L281 TraceCheckUtils]: 8: Hoare triple {1062#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} assume !(0 == __VERIFIER_assert_~cond); {1062#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} is VALID [2021-09-13 14:17:17,181 INFO L281 TraceCheckUtils]: 7: Hoare triple {1062#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1062#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} is VALID [2021-09-13 14:17:17,327 INFO L281 TraceCheckUtils]: 6: Hoare triple {1072#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {1062#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} is VALID [2021-09-13 14:17:17,327 INFO L281 TraceCheckUtils]: 5: Hoare triple {1072#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {1072#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:17:17,328 INFO L281 TraceCheckUtils]: 4: Hoare triple {1072#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == -2 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 6 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 5 * main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 + main_~y~0 * main_~y~0 + 12 * main_~x~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1072#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:17:17,328 INFO L281 TraceCheckUtils]: 3: Hoare triple {911#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {1072#(or (not (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 12 ULTIMATE.start_main_~x~0)))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:17:17,328 INFO L281 TraceCheckUtils]: 2: Hoare triple {911#true} assume !(0 == assume_abort_if_not_~cond); {911#true} is VALID [2021-09-13 14:17:17,329 INFO L281 TraceCheckUtils]: 1: Hoare triple {911#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {911#true} is VALID [2021-09-13 14:17:17,329 INFO L281 TraceCheckUtils]: 0: Hoare triple {911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {911#true} is VALID [2021-09-13 14:17:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:17,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:17,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122125754] [2021-09-13 14:17:17,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:17,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125005193] [2021-09-13 14:17:17,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125005193] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:17:17,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:17:17,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-09-13 14:17:17,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109019812] [2021-09-13 14:17:17,330 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-09-13 14:17:17,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:17,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:29,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 44 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:29,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-09-13 14:17:29,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-09-13 14:17:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=331, Unknown=1, NotChecked=0, Total=420 [2021-09-13 14:17:29,438 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:39,179 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2021-09-13 14:17:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-13 14:17:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-09-13 14:17:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2021-09-13 14:17:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2021-09-13 14:17:39,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 36 transitions. [2021-09-13 14:17:41,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:41,276 INFO L225 Difference]: With dead ends: 35 [2021-09-13 14:17:41,276 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:17:41,277 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 12251.54ms TimeCoverageRelationStatistics Valid=210, Invalid=781, Unknown=1, NotChecked=0, Total=992 [2021-09-13 14:17:41,278 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 618.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.13ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 620.32ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:41,278 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 1.13ms Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 44 Unchecked, 620.32ms Time] [2021-09-13 14:17:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:17:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:17:41,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:41,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:41,279 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:41,280 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:41,280 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:17:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:17:41,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:41,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:41,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:17:41,281 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:17:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:41,281 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:17:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:17:41,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:41,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:41,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:41,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:17:41,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2021-09-13 14:17:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:41,282 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:17:41,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:17:41,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:41,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-09-13 14:17:41,285 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-09-13 14:17:41,286 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-09-13 14:17:41,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-09-13 14:17:41,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:41,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:17:41,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:17:41,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:17:41,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:17:41,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:17:41,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:17:42,962 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (or (and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0)) (let ((.cse0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (and (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ .cse0 (* 12 ULTIMATE.start_main_~x~0))) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) .cse0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0)) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2))))))) [2021-09-13 14:17:42,962 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:17:42,963 INFO L858 garLoopResultBuilder]: For program point L27-3(lines 27 36) no Hoare annotation was computed. [2021-09-13 14:17:42,963 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:17:42,963 INFO L858 garLoopResultBuilder]: For program point L11-1(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:17:42,963 INFO L858 garLoopResultBuilder]: For program point L11-2(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:17:42,963 INFO L861 garLoopResultBuilder]: At program point L40(lines 17 41) the Hoare annotation is: true [2021-09-13 14:17:42,963 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2021-09-13 14:17:42,963 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:17:42,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:17:42,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:17:42,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:17:42,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:17:42,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:17:42,964 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:17:42,965 INFO L854 garLoopResultBuilder]: At program point L10-2(lines 30 31) the Hoare annotation is: (let ((.cse0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (and (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ .cse0 (* 12 ULTIMATE.start_main_~x~0))) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) .cse0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0)) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))) [2021-09-13 14:17:42,965 INFO L858 garLoopResultBuilder]: For program point L10-3(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:17:42,965 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2021-09-13 14:17:42,965 INFO L854 garLoopResultBuilder]: At program point L10-5(lines 9 15) the Hoare annotation is: (let ((.cse0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (and (= (+ (* 6 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 5 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ .cse0 (* 12 ULTIMATE.start_main_~x~0))) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) .cse0))) [2021-09-13 14:17:42,965 INFO L858 garLoopResultBuilder]: For program point L10-6(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:17:42,965 INFO L861 garLoopResultBuilder]: At program point L10-8(lines 9 15) the Hoare annotation is: true [2021-09-13 14:17:42,969 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:17:42,971 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:17:42,972 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:17:42,973 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:17:42,973 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:17:42,973 WARN L170 areAnnotationChecker]: L10-3 has no Hoare annotation [2021-09-13 14:17:42,973 WARN L170 areAnnotationChecker]: L10-3 has no Hoare annotation [2021-09-13 14:17:42,973 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:17:42,973 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:17:42,973 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:17:46,028 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:17:46,029 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:17:46,029 INFO L163 areAnnotationChecker]: CFG has 2 edges. 1 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:17:46,033 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,052 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,053 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:17:46 BoogieIcfgContainer [2021-09-13 14:17:46,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:17:46,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:17:46,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:17:46,062 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:17:46,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:16:43" (3/4) ... [2021-09-13 14:17:46,065 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:17:46,073 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-09-13 14:17:46,073 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:17:46,074 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:17:46,074 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:17:46,105 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:17:46,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:17:46,106 INFO L158 Benchmark]: Toolchain (without parser) took 63057.39ms. Allocated memory was 50.3MB in the beginning and 92.3MB in the end (delta: 41.9MB). Free memory was 27.4MB in the beginning and 41.0MB in the end (delta: -13.6MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2021-09-13 14:17:46,106 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:17:46,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.15ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.3MB in the beginning and 45.7MB in the end (delta: -18.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2021-09-13 14:17:46,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.33ms. Allocated memory is still 62.9MB. Free memory was 45.7MB in the beginning and 44.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:17:46,107 INFO L158 Benchmark]: Boogie Preprocessor took 18.32ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 42.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:17:46,108 INFO L158 Benchmark]: RCFGBuilder took 268.96ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 33.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:17:46,108 INFO L158 Benchmark]: TraceAbstraction took 62454.88ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 32.6MB in the beginning and 43.1MB in the end (delta: -10.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2021-09-13 14:17:46,108 INFO L158 Benchmark]: Witness Printer took 43.15ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:17:46,111 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.15ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.3MB in the beginning and 45.7MB in the end (delta: -18.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.33ms. Allocated memory is still 62.9MB. Free memory was 45.7MB in the beginning and 44.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.32ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 42.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 268.96ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 33.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 62454.88ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 32.6MB in the beginning and 43.1MB in the end (delta: -10.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 43.15ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 59309.49ms, OverallIterations: 6, TraceHistogramMax: 6, EmptinessCheckTime: 11.71ms, AutomataDifference: 18118.83ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 1472.88ms, InitialAbstractionConstructionTime: 8.06ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 1869.38ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1859.48ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 99 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 440 IncrementalHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 0 mSDtfsCounter, 440 mSolverCounterSat, 6.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 12779.73ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=5, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 143.61ms AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 26 NumberOfFragments, 265 HoareAnnotationTreeSize, 5 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 101.75ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 1539 FormulaSimplificationTreeSizeReductionInter, 1362.79ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 43.29ms SsaConstructionTime, 355.66ms SatisfiabilityAnalysisTime, 21587.09ms InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 24 QuantifiedInterpolants, 2363 SizeOfPredicates, 24 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 1/118 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2021-09-13 14:17:46,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: ((((forall ULTIMATE.start_main_~k~0 : int :: (c + 2 < ULTIMATE.start_main_~k~0 || ULTIMATE.start_main_~k~0 <= c + 1) || 4 * y + y * y + 4 == 2 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == y * y + 12 * x) && 1 <= cond) && (y * k == y * y || c < k)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 3 < ULTIMATE.start_main_~k~0 || 3 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0 == 9 + 6 * y + y * y) || ULTIMATE.start_main_~k~0 <= c + 2) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: (6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == y * y + 12 * x && 1 <= cond) && y * k == y * y - InvariantResult [Line: 27]: Loop Invariant [2021-09-13 14:17:46,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:17:46,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: ((y == 0 && x == 0) && c == 0) || (((((forall ULTIMATE.start_main_~k~0 : int :: (c + 2 < ULTIMATE.start_main_~k~0 || ULTIMATE.start_main_~k~0 <= c + 1) || 4 * y + y * y + 4 == 2 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == y * y + 12 * x) && 1 <= cond) && (y * k == y * y || c < k)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 3 < ULTIMATE.start_main_~k~0 || 3 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0 == 9 + 6 * y + y * y) || ULTIMATE.start_main_~k~0 <= c + 2)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:17:46,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...