./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound20.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound20.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 99e5cccea54789cc7c8b01ece41ae38ca7afc8c38f73e2884988b8ff4c6bfc25 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:10,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:10,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:10,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:10,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:10,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:10,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:10,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:10,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:10,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:10,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:10,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:10,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:10,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:10,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:10,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:10,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:10,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:10,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:10,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:10,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:10,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:10,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:10,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:10,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:10,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:10,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:10,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:10,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:10,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:10,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:10,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:10,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:10,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:10,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:10,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:10,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:10,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:10,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:10,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:10,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:10,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:41:10,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:10,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:10,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:10,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:10,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:10,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:10,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:10,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:10,414 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:10,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:10,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:10,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:41:10,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:10,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:10,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:10,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:10,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:10,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:10,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:10,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:10,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:10,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:10,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:10,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:10,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:10,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:10,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:10,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:10,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:41:10,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:41:10,419 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:10,419 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:10,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:10,420 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 -> 99e5cccea54789cc7c8b01ece41ae38ca7afc8c38f73e2884988b8ff4c6bfc25 [2022-02-20 17:41:10,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:10,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:10,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:10,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:10,706 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:10,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-02-20 17:41:10,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a9427b1/a52e4fc931864e3093e73b9bcb0cd561/FLAG3de86a277 [2022-02-20 17:41:11,159 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:11,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-02-20 17:41:11,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a9427b1/a52e4fc931864e3093e73b9bcb0cd561/FLAG3de86a277 [2022-02-20 17:41:11,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a9427b1/a52e4fc931864e3093e73b9bcb0cd561 [2022-02-20 17:41:11,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:11,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:11,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:11,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:11,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:11,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19504d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11, skipping insertion in model container [2022-02-20 17:41:11,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:11,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:11,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound20.c[458,471] [2022-02-20 17:41:11,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:11,391 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:11,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound20.c[458,471] [2022-02-20 17:41:11,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:11,420 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:11,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11 WrapperNode [2022-02-20 17:41:11,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:11,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:11,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:11,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:11,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,462 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-02-20 17:41:11,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:11,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:11,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:11,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:11,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:11,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:11,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:11,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:11,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (1/1) ... [2022-02-20 17:41:11,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:11,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:11,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:41:11,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:41:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:41:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:11,631 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:11,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:11,796 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:11,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:11,807 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:11,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:11 BoogieIcfgContainer [2022-02-20 17:41:11,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:11,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:11,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:11,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:11,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:11" (1/3) ... [2022-02-20 17:41:11,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d16c329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:11, skipping insertion in model container [2022-02-20 17:41:11,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:11" (2/3) ... [2022-02-20 17:41:11,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d16c329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:11, skipping insertion in model container [2022-02-20 17:41:11,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:11" (3/3) ... [2022-02-20 17:41:11,823 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound20.c [2022-02-20 17:41:11,826 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:11,826 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:11,883 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:11,890 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:41:11,890 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:41:11,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:11,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:11,921 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:11,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1819788390, now seen corresponding path program 1 times [2022-02-20 17:41:11,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:11,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339956738] [2022-02-20 17:41:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:12,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21#true} is VALID [2022-02-20 17:41:12,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {21#true} is VALID [2022-02-20 17:41:12,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-20 17:41:12,128 INFO L272 TraceCheckUtils]: 3: Hoare triple {22#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {22#false} is VALID [2022-02-20 17:41:12,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-02-20 17:41:12,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-02-20 17:41:12,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 17:41:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:12,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:12,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339956738] [2022-02-20 17:41:12,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339956738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:12,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:12,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:12,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569584964] [2022-02-20 17:41:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:41:12,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:12,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:12,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:12,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:12,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:12,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:12,186 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,245 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-02-20 17:41:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:41:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 17:41:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 17:41:12,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2022-02-20 17:41:12,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:12,334 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:41:12,334 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:41:12,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:12,340 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:12,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:41:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 17:41:12,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:12,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,370 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,371 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,377 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-20 17:41:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:12,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:12,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:12,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-02-20 17:41:12,379 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-02-20 17:41:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,383 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-20 17:41:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:12,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:12,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:12,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:12,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-20 17:41:12,392 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2022-02-20 17:41:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:12,393 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-20 17:41:12,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:12,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:12,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:12,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:41:12,396 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 178441499, now seen corresponding path program 1 times [2022-02-20 17:41:12,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:12,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481335943] [2022-02-20 17:41:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:12,425 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:12,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318678906] [2022-02-20 17:41:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:12,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:12,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:12,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:12,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:41:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:12,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:41:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:12,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:12,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {123#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:12,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {123#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:12,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {130#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:41:12,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {130#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {119#false} is VALID [2022-02-20 17:41:12,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {119#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {119#false} is VALID [2022-02-20 17:41:12,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#false} ~cond := #in~cond; {119#false} is VALID [2022-02-20 17:41:12,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {119#false} assume 0 == ~cond; {119#false} is VALID [2022-02-20 17:41:12,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 17:41:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:12,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:12,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:12,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481335943] [2022-02-20 17:41:12,585 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:12,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318678906] [2022-02-20 17:41:12,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318678906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:12,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:12,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:41:12,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422922207] [2022-02-20 17:41:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:12,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:12,591 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), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:12,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:41:12,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:41:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:12,606 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,658 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 17:41:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:41:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 17:41:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 17:41:12,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-02-20 17:41:12,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:12,695 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:41:12,695 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:41:12,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:12,697 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:12,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:41:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:41:12,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:12,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,702 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,702 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,705 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:12,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:12,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:12,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 17:41:12,707 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 17:41:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,710 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:12,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:12,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:12,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:12,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 17:41:12,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2022-02-20 17:41:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:12,716 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 17:41:12,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:12,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:12,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:12,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:12,931 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 [2022-02-20 17:41:12,931 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash 180228959, now seen corresponding path program 1 times [2022-02-20 17:41:12,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:12,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102974059] [2022-02-20 17:41:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:12,949 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:12,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137762326] [2022-02-20 17:41:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:12,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:12,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:12,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:12,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:41:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:12,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:41:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:13,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:13,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#true} is VALID [2022-02-20 17:41:13,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:13,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:13,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:13,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:13,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:13,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {233#false} is VALID [2022-02-20 17:41:13,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-02-20 17:41:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:13,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:13,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:13,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102974059] [2022-02-20 17:41:13,083 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:13,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137762326] [2022-02-20 17:41:13,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137762326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:13,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:13,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:13,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509941301] [2022-02-20 17:41:13,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:13,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:13,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:13,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:13,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:13,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:13,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:13,100 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:13,215 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 17:41:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 17:41:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 17:41:13,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-02-20 17:41:13,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:13,260 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:41:13,260 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:41:13,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:41:13,263 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:13,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:41:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:41:13,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:13,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:13,269 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:13,269 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:13,272 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:41:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:13,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:13,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:13,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:13,276 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:13,279 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:41:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:13,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:13,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:13,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:13,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 17:41:13,282 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2022-02-20 17:41:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:13,283 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 17:41:13,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:13,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:13,283 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:13,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:13,484 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 [2022-02-20 17:41:13,484 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 823572993, now seen corresponding path program 1 times [2022-02-20 17:41:13,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:13,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689879104] [2022-02-20 17:41:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:13,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:13,497 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:13,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685688075] [2022-02-20 17:41:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:13,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:13,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:13,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:41:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:13,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:41:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:13,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:13,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {372#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:13,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {377#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:13,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {384#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {384#(<= ~counter~0 1)} ~cond := #in~cond; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(<= ~counter~0 1)} assume !(0 == ~cond); {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(<= ~counter~0 1)} assume true; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,688 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {384#(<= ~counter~0 1)} {384#(<= ~counter~0 1)} #40#return; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:13,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {409#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:41:13,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {373#false} is VALID [2022-02-20 17:41:13,690 INFO L272 TraceCheckUtils]: 12: Hoare triple {373#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {373#false} is VALID [2022-02-20 17:41:13,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {373#false} ~cond := #in~cond; {373#false} is VALID [2022-02-20 17:41:13,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {373#false} assume 0 == ~cond; {373#false} is VALID [2022-02-20 17:41:13,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {373#false} assume !false; {373#false} is VALID [2022-02-20 17:41:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:13,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:13,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {373#false} assume !false; {373#false} is VALID [2022-02-20 17:41:13,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {373#false} assume 0 == ~cond; {373#false} is VALID [2022-02-20 17:41:13,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {373#false} ~cond := #in~cond; {373#false} is VALID [2022-02-20 17:41:13,808 INFO L272 TraceCheckUtils]: 12: Hoare triple {373#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {373#false} is VALID [2022-02-20 17:41:13,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(< |ULTIMATE.start_main_#t~post5#1| 20)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {373#false} is VALID [2022-02-20 17:41:13,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(< ~counter~0 20)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {437#(< |ULTIMATE.start_main_#t~post5#1| 20)} is VALID [2022-02-20 17:41:13,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {441#(< ~counter~0 20)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {441#(< ~counter~0 20)} is VALID [2022-02-20 17:41:13,810 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {372#true} {441#(< ~counter~0 20)} #40#return; {441#(< ~counter~0 20)} is VALID [2022-02-20 17:41:13,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#true} assume true; {372#true} is VALID [2022-02-20 17:41:13,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#true} assume !(0 == ~cond); {372#true} is VALID [2022-02-20 17:41:13,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {372#true} ~cond := #in~cond; {372#true} is VALID [2022-02-20 17:41:13,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {441#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {372#true} is VALID [2022-02-20 17:41:13,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#(< ~counter~0 20)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {441#(< ~counter~0 20)} is VALID [2022-02-20 17:41:13,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#(< ~counter~0 19)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {441#(< ~counter~0 20)} is VALID [2022-02-20 17:41:13,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#(< ~counter~0 19)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {466#(< ~counter~0 19)} is VALID [2022-02-20 17:41:13,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {372#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#(< ~counter~0 19)} is VALID [2022-02-20 17:41:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:13,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:13,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689879104] [2022-02-20 17:41:13,821 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:13,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685688075] [2022-02-20 17:41:13,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685688075] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:13,822 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:13,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:41:13,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401750481] [2022-02-20 17:41:13,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:41:13,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:13,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:13,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:13,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:13,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:13,850 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:14,077 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-02-20 17:41:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:14,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:41:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 17:41:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 17:41:14,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-02-20 17:41:14,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:14,148 INFO L225 Difference]: With dead ends: 56 [2022-02-20 17:41:14,148 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:41:14,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:41:14,149 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:14,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 72 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:41:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:41:14,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:14,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:14,169 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:14,169 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:14,172 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:41:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:41:14,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:14,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:14,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-02-20 17:41:14,182 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-02-20 17:41:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:14,185 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:41:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:41:14,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:14,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:14,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:14,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-02-20 17:41:14,190 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 16 [2022-02-20 17:41:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:14,190 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-02-20 17:41:14,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-02-20 17:41:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:14,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:14,191 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:14,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:14,407 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 [2022-02-20 17:41:14,407 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 825360453, now seen corresponding path program 1 times [2022-02-20 17:41:14,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:14,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877708939] [2022-02-20 17:41:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:14,428 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:14,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274692922] [2022-02-20 17:41:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:14,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:14,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:41:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:14,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:14,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:14,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {715#true} is VALID [2022-02-20 17:41:14,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:14,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:14,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:14,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {715#true} is VALID [2022-02-20 17:41:14,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-02-20 17:41:14,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-02-20 17:41:14,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} assume true; {715#true} is VALID [2022-02-20 17:41:14,612 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {715#true} {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #40#return; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:14,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:14,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:14,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:14,615 INFO L272 TraceCheckUtils]: 12: Hoare triple {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:14,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:14,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-02-20 17:41:14,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-02-20 17:41:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:14,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:14,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-02-20 17:41:14,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-02-20 17:41:14,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:15,000 INFO L272 TraceCheckUtils]: 12: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:15,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:15,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:15,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:15,097 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {715#true} {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} #40#return; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:15,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} assume true; {715#true} is VALID [2022-02-20 17:41:15,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-02-20 17:41:15,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-02-20 17:41:15,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {715#true} is VALID [2022-02-20 17:41:15,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:15,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:15,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:15,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {715#true} is VALID [2022-02-20 17:41:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:41:15,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:15,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877708939] [2022-02-20 17:41:15,102 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:15,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274692922] [2022-02-20 17:41:15,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274692922] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:15,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:15,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:41:15,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060110030] [2022-02-20 17:41:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:15,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:15,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:15,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:15,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:15,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:15,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:15,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:15,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:41:15,129 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:15,252 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-02-20 17:41:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:15,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-02-20 17:41:15,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:15,288 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:41:15,288 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:41:15,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:15,290 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:15,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:41:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-02-20 17:41:15,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:15,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:15,305 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:15,306 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:15,308 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 17:41:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-02-20 17:41:15,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:15,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:15,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 17:41:15,309 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 17:41:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:15,311 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 17:41:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-02-20 17:41:15,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:15,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:15,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:15,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-02-20 17:41:15,314 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-02-20 17:41:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:15,315 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-02-20 17:41:15,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-02-20 17:41:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:41:15,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:15,316 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:15,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:15,535 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 [2022-02-20 17:41:15,535 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1696898494, now seen corresponding path program 1 times [2022-02-20 17:41:15,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:15,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307028460] [2022-02-20 17:41:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:15,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:15,547 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:15,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822580022] [2022-02-20 17:41:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:15,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:15,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:41:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:15,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:41:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:15,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:15,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {1046#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1046#true} is VALID [2022-02-20 17:41:15,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1046#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:15,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:15,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:15,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1046#true} is VALID [2022-02-20 17:41:15,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {1046#true} ~cond := #in~cond; {1046#true} is VALID [2022-02-20 17:41:15,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {1046#true} assume !(0 == ~cond); {1046#true} is VALID [2022-02-20 17:41:15,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {1046#true} assume true; {1046#true} is VALID [2022-02-20 17:41:15,947 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1046#true} {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:15,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:15,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:15,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:15,949 INFO L272 TraceCheckUtils]: 12: Hoare triple {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1046#true} is VALID [2022-02-20 17:41:15,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1046#true} ~cond := #in~cond; {1046#true} is VALID [2022-02-20 17:41:15,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#true} assume !(0 == ~cond); {1046#true} is VALID [2022-02-20 17:41:15,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {1046#true} assume true; {1046#true} is VALID [2022-02-20 17:41:15,953 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1046#true} {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #40#return; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:15,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {1104#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:15,955 INFO L272 TraceCheckUtils]: 18: Hoare triple {1104#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1108#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:15,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {1108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:15,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {1112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1047#false} is VALID [2022-02-20 17:41:15,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {1047#false} assume !false; {1047#false} is VALID [2022-02-20 17:41:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:41:15,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:16,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:16,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307028460] [2022-02-20 17:41:16,271 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:16,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822580022] [2022-02-20 17:41:16,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822580022] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:16,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:16,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:41:16,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119441506] [2022-02-20 17:41:16,272 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:16,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:16,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:16,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:16,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:41:16,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:41:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:41:16,297 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,497 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-02-20 17:41:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:41:16,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-02-20 17:41:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-02-20 17:41:16,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-02-20 17:41:16,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:16,527 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:41:16,527 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 17:41:16,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:16,528 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:16,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 17:41:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 17:41:16,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:16,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:16,545 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:16,545 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,547 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-02-20 17:41:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-02-20 17:41:16,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:16,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:16,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:16,548 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,550 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-02-20 17:41:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-02-20 17:41:16,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:16,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:16,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:16,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-02-20 17:41:16,553 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2022-02-20 17:41:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:16,553 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-02-20 17:41:16,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-02-20 17:41:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:41:16,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:16,554 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:16,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:16,775 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 [2022-02-20 17:41:16,776 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash -47987544, now seen corresponding path program 2 times [2022-02-20 17:41:16,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:16,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309292335] [2022-02-20 17:41:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:16,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:16,805 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:16,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883350167] [2022-02-20 17:41:16,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:16,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:16,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:16,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:16,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:41:16,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:16,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:16,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:41:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:16,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:17,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {1368#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1368#true} is VALID [2022-02-20 17:41:17,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {1368#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:17,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:17,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:17,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1368#true} is VALID [2022-02-20 17:41:17,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {1368#true} ~cond := #in~cond; {1368#true} is VALID [2022-02-20 17:41:17,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {1368#true} assume !(0 == ~cond); {1368#true} is VALID [2022-02-20 17:41:17,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1368#true} assume true; {1368#true} is VALID [2022-02-20 17:41:17,244 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1368#true} {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:17,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:17,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:17,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:17,246 INFO L272 TraceCheckUtils]: 12: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1368#true} is VALID [2022-02-20 17:41:17,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {1368#true} ~cond := #in~cond; {1368#true} is VALID [2022-02-20 17:41:17,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {1368#true} assume !(0 == ~cond); {1368#true} is VALID [2022-02-20 17:41:17,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {1368#true} assume true; {1368#true} is VALID [2022-02-20 17:41:17,252 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1368#true} {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} #40#return; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:17,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:17,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:17,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:17,254 INFO L272 TraceCheckUtils]: 20: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1368#true} is VALID [2022-02-20 17:41:17,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {1368#true} ~cond := #in~cond; {1368#true} is VALID [2022-02-20 17:41:17,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {1368#true} assume !(0 == ~cond); {1368#true} is VALID [2022-02-20 17:41:17,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#true} assume true; {1368#true} is VALID [2022-02-20 17:41:17,255 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1368#true} {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #40#return; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:17,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {1451#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:17,257 INFO L272 TraceCheckUtils]: 26: Hoare triple {1451#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:17,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {1455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:17,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {1459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1369#false} is VALID [2022-02-20 17:41:17,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {1369#false} assume !false; {1369#false} is VALID [2022-02-20 17:41:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:17,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:17,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:17,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309292335] [2022-02-20 17:41:17,895 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:17,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883350167] [2022-02-20 17:41:17,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883350167] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:17,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:17,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:41:17,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925888877] [2022-02-20 17:41:17,896 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-02-20 17:41:17,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:17,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:17,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:17,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:17,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:17,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:17,926 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:18,163 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-02-20 17:41:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:41:18,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-02-20 17:41:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-02-20 17:41:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-02-20 17:41:18,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-02-20 17:41:18,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:18,206 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:41:18,206 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 17:41:18,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:18,207 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:18,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 17:41:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 17:41:18,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:18,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:18,228 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:18,229 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:18,230 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-02-20 17:41:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 17:41:18,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:18,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:18,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:18,232 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:18,233 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-02-20 17:41:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 17:41:18,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:18,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:18,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:18,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-02-20 17:41:18,235 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 30 [2022-02-20 17:41:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:18,236 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-02-20 17:41:18,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 17:41:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:41:18,237 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:18,237 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:18,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:18,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:18,440 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:18,441 INFO L85 PathProgramCache]: Analyzing trace with hash -584163058, now seen corresponding path program 3 times [2022-02-20 17:41:18,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:18,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919940484] [2022-02-20 17:41:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:18,475 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:18,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615110352] [2022-02-20 17:41:18,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:18,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:18,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:18,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:18,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:41:18,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:41:18,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:18,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:41:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:18,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:18,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {1740#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1740#true} is VALID [2022-02-20 17:41:18,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:18,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:18,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:18,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:18,889 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1740#true} {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,891 INFO L272 TraceCheckUtils]: 12: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:18,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:18,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:18,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:18,892 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1740#true} {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:18,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:18,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:18,894 INFO L272 TraceCheckUtils]: 20: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:18,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:18,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:18,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:18,895 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1740#true} {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:18,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:18,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:18,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:18,897 INFO L272 TraceCheckUtils]: 28: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:18,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:18,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:18,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:18,898 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1740#true} {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} #40#return; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:18,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !(main_~c~0#1 < main_~k~0#1); {1848#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:18,899 INFO L272 TraceCheckUtils]: 34: Hoare triple {1848#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:18,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {1852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:18,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {1856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1741#false} is VALID [2022-02-20 17:41:18,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2022-02-20 17:41:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:41:18,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:19,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:19,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919940484] [2022-02-20 17:41:19,184 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:19,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615110352] [2022-02-20 17:41:19,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615110352] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:19,185 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:19,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-02-20 17:41:19,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709179985] [2022-02-20 17:41:19,185 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2022-02-20 17:41:19,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:19,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:19,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:19,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:41:19,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:19,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:41:19,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:19,235 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:19,527 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 17:41:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:41:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2022-02-20 17:41:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-02-20 17:41:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-02-20 17:41:19,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-02-20 17:41:19,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:19,563 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:41:19,563 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 17:41:19,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:19,564 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:19,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 17:41:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 17:41:19,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:19,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,585 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,585 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:19,587 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-02-20 17:41:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 17:41:19,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:19,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:19,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 43 states. [2022-02-20 17:41:19,588 INFO L87 Difference]: Start difference. First operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 43 states. [2022-02-20 17:41:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:19,589 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-02-20 17:41:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 17:41:19,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:19,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:19,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:19,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-02-20 17:41:19,591 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2022-02-20 17:41:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:19,594 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-02-20 17:41:19,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 17:41:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 17:41:19,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:19,597 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:19,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:19,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:19,820 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2045303987, now seen corresponding path program 2 times [2022-02-20 17:41:19,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:19,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916017877] [2022-02-20 17:41:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:19,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:19,830 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:19,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991352770] [2022-02-20 17:41:19,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:19,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:19,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:19,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:19,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:41:19,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:19,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:19,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:19,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:20,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {2122#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2127#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:20,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {2127#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2127#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:20,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {2134#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {2134#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {2134#(<= ~counter~0 1)} ~cond := #in~cond; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {2134#(<= ~counter~0 1)} assume !(0 == ~cond); {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(<= ~counter~0 1)} assume true; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,127 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2134#(<= ~counter~0 1)} {2134#(<= ~counter~0 1)} #40#return; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {2134#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:20,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {2134#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {2159#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,130 INFO L272 TraceCheckUtils]: 12: Hoare triple {2159#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {2159#(<= ~counter~0 2)} ~cond := #in~cond; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {2159#(<= ~counter~0 2)} assume !(0 == ~cond); {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {2159#(<= ~counter~0 2)} assume true; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,132 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2159#(<= ~counter~0 2)} {2159#(<= ~counter~0 2)} #40#return; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {2159#(<= ~counter~0 2)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:20,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {2159#(<= ~counter~0 2)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {2184#(<= ~counter~0 3)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,134 INFO L272 TraceCheckUtils]: 20: Hoare triple {2184#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {2184#(<= ~counter~0 3)} ~cond := #in~cond; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {2184#(<= ~counter~0 3)} assume !(0 == ~cond); {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(<= ~counter~0 3)} assume true; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,140 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2184#(<= ~counter~0 3)} {2184#(<= ~counter~0 3)} #40#return; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {2184#(<= ~counter~0 3)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:20,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {2184#(<= ~counter~0 3)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {2209#(<= ~counter~0 4)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,143 INFO L272 TraceCheckUtils]: 28: Hoare triple {2209#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {2209#(<= ~counter~0 4)} ~cond := #in~cond; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {2209#(<= ~counter~0 4)} assume !(0 == ~cond); {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {2209#(<= ~counter~0 4)} assume true; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,144 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2209#(<= ~counter~0 4)} {2209#(<= ~counter~0 4)} #40#return; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {2209#(<= ~counter~0 4)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:20,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {2209#(<= ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2234#(<= |ULTIMATE.start_main_#t~post5#1| 4)} is VALID [2022-02-20 17:41:20,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {2234#(<= |ULTIMATE.start_main_#t~post5#1| 4)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2123#false} is VALID [2022-02-20 17:41:20,146 INFO L272 TraceCheckUtils]: 36: Hoare triple {2123#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2123#false} is VALID [2022-02-20 17:41:20,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2022-02-20 17:41:20,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2022-02-20 17:41:20,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2022-02-20 17:41:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:20,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:20,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2022-02-20 17:41:20,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2022-02-20 17:41:20,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2022-02-20 17:41:20,412 INFO L272 TraceCheckUtils]: 36: Hoare triple {2123#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2123#false} is VALID [2022-02-20 17:41:20,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {2262#(< |ULTIMATE.start_main_#t~post5#1| 20)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2123#false} is VALID [2022-02-20 17:41:20,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {2266#(< ~counter~0 20)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2262#(< |ULTIMATE.start_main_#t~post5#1| 20)} is VALID [2022-02-20 17:41:20,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {2266#(< ~counter~0 20)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2266#(< ~counter~0 20)} is VALID [2022-02-20 17:41:20,414 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2122#true} {2266#(< ~counter~0 20)} #40#return; {2266#(< ~counter~0 20)} is VALID [2022-02-20 17:41:20,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:20,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:20,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:20,415 INFO L272 TraceCheckUtils]: 28: Hoare triple {2266#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:20,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {2266#(< ~counter~0 20)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2266#(< ~counter~0 20)} is VALID [2022-02-20 17:41:20,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {2291#(< ~counter~0 19)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2266#(< ~counter~0 20)} is VALID [2022-02-20 17:41:20,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {2291#(< ~counter~0 19)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2291#(< ~counter~0 19)} is VALID [2022-02-20 17:41:20,417 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2122#true} {2291#(< ~counter~0 19)} #40#return; {2291#(< ~counter~0 19)} is VALID [2022-02-20 17:41:20,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:20,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:20,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:20,417 INFO L272 TraceCheckUtils]: 20: Hoare triple {2291#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:20,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {2291#(< ~counter~0 19)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2291#(< ~counter~0 19)} is VALID [2022-02-20 17:41:20,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {2316#(< ~counter~0 18)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2291#(< ~counter~0 19)} is VALID [2022-02-20 17:41:20,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {2316#(< ~counter~0 18)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2316#(< ~counter~0 18)} is VALID [2022-02-20 17:41:20,424 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2122#true} {2316#(< ~counter~0 18)} #40#return; {2316#(< ~counter~0 18)} is VALID [2022-02-20 17:41:20,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:20,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:20,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:20,430 INFO L272 TraceCheckUtils]: 12: Hoare triple {2316#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:20,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {2316#(< ~counter~0 18)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2316#(< ~counter~0 18)} is VALID [2022-02-20 17:41:20,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {2341#(< ~counter~0 17)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2316#(< ~counter~0 18)} is VALID [2022-02-20 17:41:20,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#(< ~counter~0 17)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2341#(< ~counter~0 17)} is VALID [2022-02-20 17:41:20,433 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2122#true} {2341#(< ~counter~0 17)} #40#return; {2341#(< ~counter~0 17)} is VALID [2022-02-20 17:41:20,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:20,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:20,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:20,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {2341#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:20,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {2341#(< ~counter~0 17)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2341#(< ~counter~0 17)} is VALID [2022-02-20 17:41:20,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {2366#(< ~counter~0 16)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2341#(< ~counter~0 17)} is VALID [2022-02-20 17:41:20,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {2366#(< ~counter~0 16)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2366#(< ~counter~0 16)} is VALID [2022-02-20 17:41:20,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {2122#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2366#(< ~counter~0 16)} is VALID [2022-02-20 17:41:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:41:20,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:20,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916017877] [2022-02-20 17:41:20,436 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:20,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991352770] [2022-02-20 17:41:20,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991352770] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:20,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:20,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 17:41:20,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519536660] [2022-02-20 17:41:20,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:20,438 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 40 [2022-02-20 17:41:20,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:20,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:20,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:20,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:41:20,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:41:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:20,493 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:20,954 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-02-20 17:41:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 17:41:20,954 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 40 [2022-02-20 17:41:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2022-02-20 17:41:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2022-02-20 17:41:20,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 119 transitions. [2022-02-20 17:41:21,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:21,102 INFO L225 Difference]: With dead ends: 119 [2022-02-20 17:41:21,102 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 17:41:21,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:41:21,103 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 108 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:21,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 132 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 17:41:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2022-02-20 17:41:21,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:21,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:21,157 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:21,157 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:21,161 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-02-20 17:41:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-02-20 17:41:21,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:21,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:21,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 114 states. [2022-02-20 17:41:21,163 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 114 states. [2022-02-20 17:41:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:21,166 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-02-20 17:41:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-02-20 17:41:21,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:21,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:21,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:21,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-02-20 17:41:21,170 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 40 [2022-02-20 17:41:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:21,170 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-02-20 17:41:21,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-02-20 17:41:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:41:21,171 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:21,171 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:21,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:21,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 17:41:21,388 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash -635357324, now seen corresponding path program 4 times [2022-02-20 17:41:21,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:21,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593113531] [2022-02-20 17:41:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:21,401 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:21,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336052218] [2022-02-20 17:41:21,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:41:21,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:21,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:21,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:21,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:41:21,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:41:21,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:21,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:41:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:21,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:22,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {2904#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2904#true} is VALID [2022-02-20 17:41:22,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:22,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:22,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:22,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:22,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:22,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:22,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:22,026 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2904#true} {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:22,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:22,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:22,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:22,028 INFO L272 TraceCheckUtils]: 12: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:22,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:22,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:22,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:22,029 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2904#true} {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:22,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:22,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:22,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:22,031 INFO L272 TraceCheckUtils]: 20: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:22,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:22,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:22,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:22,033 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2904#true} {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #40#return; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:22,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:22,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:22,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:22,035 INFO L272 TraceCheckUtils]: 28: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:22,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:22,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:22,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:22,036 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2904#true} {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:22,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:22,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:22,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:22,038 INFO L272 TraceCheckUtils]: 36: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:22,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:22,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:22,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:22,039 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2904#true} {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} #40#return; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:22,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3037#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:22,041 INFO L272 TraceCheckUtils]: 42: Hoare triple {3037#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:22,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:22,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {3045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2905#false} is VALID [2022-02-20 17:41:22,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2022-02-20 17:41:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:41:22,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:22,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:22,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593113531] [2022-02-20 17:41:22,370 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:22,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336052218] [2022-02-20 17:41:22,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336052218] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:22,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:22,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:41:22,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712937550] [2022-02-20 17:41:22,371 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:22,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 46 [2022-02-20 17:41:22,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:22,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:22,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:22,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:41:22,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:41:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:41:22,404 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:22,815 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-02-20 17:41:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 46 [2022-02-20 17:41:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-20 17:41:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-20 17:41:22,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-02-20 17:41:22,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:22,868 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:22,868 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:22,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:41:22,869 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:22,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 214 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:22,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:22,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,933 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,934 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:22,937 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 17:41:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 17:41:22,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:22,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:22,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:22,938 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:22,940 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 17:41:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 17:41:22,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:22,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:22,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:22,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-02-20 17:41:22,944 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 46 [2022-02-20 17:41:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:22,944 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-02-20 17:41:22,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 17:41:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 17:41:22,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:22,946 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:22,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-20 17:41:23,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:41:23,151 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:23,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 220350426, now seen corresponding path program 5 times [2022-02-20 17:41:23,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:23,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194067966] [2022-02-20 17:41:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:23,162 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:23,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911409434] [2022-02-20 17:41:23,163 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:41:23,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:23,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:23,164 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:23,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 17:41:23,373 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 17:41:23,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:23,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 17:41:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:23,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:23,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {3529#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3529#true} is VALID [2022-02-20 17:41:23,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {3529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:23,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:23,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:23,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:23,841 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3529#true} {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,843 INFO L272 TraceCheckUtils]: 12: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:23,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:23,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:23,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:23,844 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3529#true} {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,845 INFO L272 TraceCheckUtils]: 20: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:23,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:23,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:23,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:23,847 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3529#true} {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,848 INFO L272 TraceCheckUtils]: 28: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:23,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:23,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:23,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:23,850 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3529#true} {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:23,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:23,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:23,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:23,851 INFO L272 TraceCheckUtils]: 36: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:23,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:23,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:23,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:23,852 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3529#true} {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:23,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:23,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:23,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:23,854 INFO L272 TraceCheckUtils]: 44: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:23,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:23,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:23,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:23,855 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3529#true} {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} #40#return; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:23,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:23,856 INFO L272 TraceCheckUtils]: 50: Hoare triple {3687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:23,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {3691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:23,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {3695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3530#false} is VALID [2022-02-20 17:41:23,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {3530#false} assume !false; {3530#false} is VALID [2022-02-20 17:41:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:41:23,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:24,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:24,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194067966] [2022-02-20 17:41:24,157 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:24,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911409434] [2022-02-20 17:41:24,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911409434] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:24,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:24,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:41:24,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875785556] [2022-02-20 17:41:24,158 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:24,158 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-02-20 17:41:24,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:24,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:24,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:24,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:41:24,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:41:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:24,190 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:24,642 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-02-20 17:41:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:41:24,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-02-20 17:41:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-02-20 17:41:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-02-20 17:41:24,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-02-20 17:41:24,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:24,689 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:24,689 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:24,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:41:24,690 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:24,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 268 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:24,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:24,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,747 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,747 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:24,751 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 17:41:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 17:41:24,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:24,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:24,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:24,752 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:24,755 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 17:41:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 17:41:24,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:24,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:24,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:24,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-02-20 17:41:24,764 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 54 [2022-02-20 17:41:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:24,764 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-02-20 17:41:24,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 17:41:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 17:41:24,765 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:24,765 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:24,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:24,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 17:41:24,967 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 156734016, now seen corresponding path program 6 times [2022-02-20 17:41:24,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:24,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667116722] [2022-02-20 17:41:24,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:24,981 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:24,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121762903] [2022-02-20 17:41:24,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:41:24,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:24,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:24,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:25,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 17:41:25,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 17:41:25,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:25,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:41:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:25,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:25,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {4179#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4179#true} is VALID [2022-02-20 17:41:25,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {4179#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:25,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:25,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:25,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:25,696 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4179#true} {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:25,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:25,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:25,701 INFO L272 TraceCheckUtils]: 12: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:25,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:25,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:25,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:25,706 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4179#true} {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:25,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,708 INFO L272 TraceCheckUtils]: 20: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:25,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:25,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:25,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:25,709 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4179#true} {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:25,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:25,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:25,711 INFO L272 TraceCheckUtils]: 28: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:25,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:25,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:25,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:25,712 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4179#true} {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #40#return; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:25,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,714 INFO L272 TraceCheckUtils]: 36: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:25,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:25,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:25,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:25,715 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4179#true} {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:25,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:25,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:25,717 INFO L272 TraceCheckUtils]: 44: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:25,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:25,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:25,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:25,718 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4179#true} {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:25,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,720 INFO L272 TraceCheckUtils]: 52: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:25,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:25,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:25,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:25,721 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4179#true} {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #40#return; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {4362#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,722 INFO L272 TraceCheckUtils]: 58: Hoare triple {4362#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:25,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {4366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:25,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {4370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4180#false} is VALID [2022-02-20 17:41:25,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {4180#false} assume !false; {4180#false} is VALID [2022-02-20 17:41:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:41:25,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:26,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:26,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667116722] [2022-02-20 17:41:26,296 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:26,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121762903] [2022-02-20 17:41:26,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121762903] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:26,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:26,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-02-20 17:41:26,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939760708] [2022-02-20 17:41:26,297 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:26,298 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 62 [2022-02-20 17:41:26,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:26,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:26,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:26,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:41:26,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:41:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:41:26,341 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:26,945 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-20 17:41:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:41:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 62 [2022-02-20 17:41:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-02-20 17:41:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-02-20 17:41:26,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-02-20 17:41:27,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:27,005 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:27,006 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:27,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:41:27,006 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:27,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 328 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:27,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:27,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:27,050 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:27,050 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:27,052 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-02-20 17:41:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-02-20 17:41:27,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:27,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:27,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:27,053 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:27,054 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-02-20 17:41:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-02-20 17:41:27,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:27,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:27,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:27,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-02-20 17:41:27,057 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 62 [2022-02-20 17:41:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:27,057 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-02-20 17:41:27,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-02-20 17:41:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 17:41:27,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:27,058 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:27,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:27,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:41:27,264 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash -605612378, now seen corresponding path program 7 times [2022-02-20 17:41:27,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:27,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382648605] [2022-02-20 17:41:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:27,287 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:27,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840169127] [2022-02-20 17:41:27,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:41:27,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:27,289 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:27,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 17:41:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:27,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 17:41:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:27,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:28,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {4854#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4854#true} is VALID [2022-02-20 17:41:28,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {4854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:28,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:28,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:28,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,253 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4854#true} {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:28,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:28,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:28,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:28,255 INFO L272 TraceCheckUtils]: 12: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,256 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4854#true} {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:28,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,258 INFO L272 TraceCheckUtils]: 20: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,259 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4854#true} {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:28,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:28,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:28,260 INFO L272 TraceCheckUtils]: 28: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,261 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4854#true} {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:28,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:28,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:28,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:28,263 INFO L272 TraceCheckUtils]: 36: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,264 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4854#true} {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #40#return; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:28,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,266 INFO L272 TraceCheckUtils]: 44: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,267 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4854#true} {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} #40#return; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,269 INFO L272 TraceCheckUtils]: 52: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,270 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4854#true} {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:28,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:28,271 INFO L290 TraceCheckUtils]: 58: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:28,271 INFO L290 TraceCheckUtils]: 59: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:28,271 INFO L272 TraceCheckUtils]: 60: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:28,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:28,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:28,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:28,272 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4854#true} {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} #40#return; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:28,273 INFO L290 TraceCheckUtils]: 65: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !(main_~c~0#1 < main_~k~0#1); {5062#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:28,274 INFO L272 TraceCheckUtils]: 66: Hoare triple {5062#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5066#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:28,274 INFO L290 TraceCheckUtils]: 67: Hoare triple {5066#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5070#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:28,274 INFO L290 TraceCheckUtils]: 68: Hoare triple {5070#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4855#false} is VALID [2022-02-20 17:41:28,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {4855#false} assume !false; {4855#false} is VALID [2022-02-20 17:41:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:41:28,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:28,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:28,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382648605] [2022-02-20 17:41:28,814 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:28,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840169127] [2022-02-20 17:41:28,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840169127] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:28,814 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:28,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:41:28,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777292506] [2022-02-20 17:41:28,814 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 70 [2022-02-20 17:41:28,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:28,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:28,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:28,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:41:28,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:28,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:41:28,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:41:28,854 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,469 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-02-20 17:41:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:41:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 70 [2022-02-20 17:41:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-02-20 17:41:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-02-20 17:41:29,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-02-20 17:41:29,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:29,538 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:29,538 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:29,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:41:29,539 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:29,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:29,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:29,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:29,582 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:29,582 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,584 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-02-20 17:41:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-02-20 17:41:29,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:29,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:29,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:29,585 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,587 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-02-20 17:41:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-02-20 17:41:29,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:29,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:29,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:29,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-02-20 17:41:29,590 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 70 [2022-02-20 17:41:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:29,590 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-02-20 17:41:29,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-02-20 17:41:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 17:41:29,591 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:29,591 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:29,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:29,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 17:41:29,798 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash 200725772, now seen corresponding path program 8 times [2022-02-20 17:41:29,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:29,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657169135] [2022-02-20 17:41:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:29,810 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:29,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156750964] [2022-02-20 17:41:29,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:29,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:29,812 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 17:41:30,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:30,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:30,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 17:41:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:30,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:30,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {5554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5554#true} is VALID [2022-02-20 17:41:30,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {5554#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:30,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:30,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:30,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,799 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5554#true} {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:30,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:30,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:30,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:30,800 INFO L272 TraceCheckUtils]: 12: Hoare triple {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,801 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5554#true} {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:30,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,802 INFO L272 TraceCheckUtils]: 20: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,803 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5554#true} {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,804 INFO L272 TraceCheckUtils]: 28: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,816 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5554#true} {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:30,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:30,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:30,817 INFO L272 TraceCheckUtils]: 36: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,818 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5554#true} {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:30,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:30,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:30,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:30,820 INFO L272 TraceCheckUtils]: 44: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,821 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5554#true} {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:30,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,822 INFO L272 TraceCheckUtils]: 52: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,823 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5554#true} {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:30,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:30,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:30,825 INFO L290 TraceCheckUtils]: 59: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:30,825 INFO L272 TraceCheckUtils]: 60: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,826 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5554#true} {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #40#return; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:30,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:30,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:30,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:30,827 INFO L272 TraceCheckUtils]: 68: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:30,828 INFO L290 TraceCheckUtils]: 69: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:30,828 INFO L290 TraceCheckUtils]: 70: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:30,828 INFO L290 TraceCheckUtils]: 71: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:30,828 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5554#true} {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} #40#return; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:30,829 INFO L290 TraceCheckUtils]: 73: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {5787#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:30,830 INFO L272 TraceCheckUtils]: 74: Hoare triple {5787#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:30,830 INFO L290 TraceCheckUtils]: 75: Hoare triple {5791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:30,831 INFO L290 TraceCheckUtils]: 76: Hoare triple {5795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5555#false} is VALID [2022-02-20 17:41:30,831 INFO L290 TraceCheckUtils]: 77: Hoare triple {5555#false} assume !false; {5555#false} is VALID [2022-02-20 17:41:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 17:41:30,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:31,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:31,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657169135] [2022-02-20 17:41:31,170 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:31,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156750964] [2022-02-20 17:41:31,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156750964] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:31,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:31,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-02-20 17:41:31,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97836293] [2022-02-20 17:41:31,171 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:31,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 78 [2022-02-20 17:41:31,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:31,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:31,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:31,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:41:31,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:31,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:41:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:41:31,217 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:32,000 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-02-20 17:41:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:41:32,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 78 [2022-02-20 17:41:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-02-20 17:41:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-02-20 17:41:32,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2022-02-20 17:41:32,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:32,063 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:32,063 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:32,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:41:32,064 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:32,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 466 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:41:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:32,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:32,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:32,125 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:32,127 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:32,129 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-02-20 17:41:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-02-20 17:41:32,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:32,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:32,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:32,130 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:32,132 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-02-20 17:41:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-02-20 17:41:32,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:32,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:32,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:32,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-02-20 17:41:32,134 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 78 [2022-02-20 17:41:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:32,134 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-02-20 17:41:32,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-02-20 17:41:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:41:32,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:32,135 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:32,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:32,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-20 17:41:32,342 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1699951246, now seen corresponding path program 9 times [2022-02-20 17:41:32,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:32,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635391786] [2022-02-20 17:41:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:32,364 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:32,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647909711] [2022-02-20 17:41:32,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:32,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:32,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:32,375 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:32,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-20 17:41:32,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-02-20 17:41:32,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:32,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 17:41:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:32,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:33,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {6279#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6279#true} is VALID [2022-02-20 17:41:33,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:33,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:33,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:33,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,286 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6279#true} {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:33,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:33,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:33,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:33,288 INFO L272 TraceCheckUtils]: 12: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6279#true} {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:33,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,290 INFO L272 TraceCheckUtils]: 20: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,291 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6279#true} {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:33,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:33,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:33,293 INFO L272 TraceCheckUtils]: 28: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,294 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6279#true} {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:33,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:33,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:33,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:33,295 INFO L272 TraceCheckUtils]: 36: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,296 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6279#true} {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:33,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,297 INFO L272 TraceCheckUtils]: 44: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,298 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6279#true} {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #40#return; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:33,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,301 INFO L272 TraceCheckUtils]: 52: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,301 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6279#true} {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,303 INFO L272 TraceCheckUtils]: 60: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,304 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6279#true} {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:33,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:33,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:33,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:33,305 INFO L272 TraceCheckUtils]: 68: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,305 INFO L290 TraceCheckUtils]: 71: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,306 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {6279#true} {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} #40#return; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:33,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:33,307 INFO L290 TraceCheckUtils]: 74: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:33,307 INFO L290 TraceCheckUtils]: 75: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:33,307 INFO L272 TraceCheckUtils]: 76: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:33,307 INFO L290 TraceCheckUtils]: 77: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:33,307 INFO L290 TraceCheckUtils]: 78: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:33,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:33,308 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6279#true} {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} #40#return; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:33,308 INFO L290 TraceCheckUtils]: 81: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} assume !(main_~c~0#1 < main_~k~0#1); {6537#(and (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:41:33,309 INFO L272 TraceCheckUtils]: 82: Hoare triple {6537#(and (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:33,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {6541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:33,310 INFO L290 TraceCheckUtils]: 84: Hoare triple {6545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6280#false} is VALID [2022-02-20 17:41:33,310 INFO L290 TraceCheckUtils]: 85: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-02-20 17:41:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 20 proven. 180 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 17:41:33,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:33,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:33,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635391786] [2022-02-20 17:41:33,621 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:33,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647909711] [2022-02-20 17:41:33,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647909711] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:33,621 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:33,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 17:41:33,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540341240] [2022-02-20 17:41:33,622 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:33,622 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 86 [2022-02-20 17:41:33,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:33,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:33,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:41:33,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:41:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:41:33,669 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,582 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2022-02-20 17:41:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 17:41:34,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 86 [2022-02-20 17:41:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2022-02-20 17:41:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2022-02-20 17:41:34,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 70 transitions. [2022-02-20 17:41:34,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:34,640 INFO L225 Difference]: With dead ends: 96 [2022-02-20 17:41:34,640 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 17:41:34,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:41:34,641 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:34,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 544 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:41:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 17:41:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 17:41:34,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:34,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:34,691 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:34,692 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,693 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-02-20 17:41:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-02-20 17:41:34,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:34,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:34,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 91 states. [2022-02-20 17:41:34,695 INFO L87 Difference]: Start difference. First operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 91 states. [2022-02-20 17:41:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,696 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-02-20 17:41:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-02-20 17:41:34,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:34,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:34,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:34,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2022-02-20 17:41:34,699 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 86 [2022-02-20 17:41:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:34,700 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2022-02-20 17:41:34,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-02-20 17:41:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 17:41:34,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:34,701 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:34,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:34,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:34,910 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -780287977, now seen corresponding path program 3 times [2022-02-20 17:41:34,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:34,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377422138] [2022-02-20 17:41:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:34,928 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:34,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340085340] [2022-02-20 17:41:34,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:34,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:34,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:34,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-20 17:41:35,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 17:41:35,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:35,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:41:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:35,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:36,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {7039#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7044#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:36,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {7044#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {7044#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:36,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {7044#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {7051#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {7051#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {7051#(<= ~counter~0 1)} ~cond := #in~cond; {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {7051#(<= ~counter~0 1)} assume !(0 == ~cond); {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {7051#(<= ~counter~0 1)} assume true; {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,077 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7051#(<= ~counter~0 1)} {7051#(<= ~counter~0 1)} #40#return; {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {7051#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7051#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:36,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {7051#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {7076#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,078 INFO L272 TraceCheckUtils]: 12: Hoare triple {7076#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {7076#(<= ~counter~0 2)} ~cond := #in~cond; {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {7076#(<= ~counter~0 2)} assume !(0 == ~cond); {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {7076#(<= ~counter~0 2)} assume true; {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,080 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7076#(<= ~counter~0 2)} {7076#(<= ~counter~0 2)} #40#return; {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {7076#(<= ~counter~0 2)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7076#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:36,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {7076#(<= ~counter~0 2)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {7101#(<= ~counter~0 3)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,081 INFO L272 TraceCheckUtils]: 20: Hoare triple {7101#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {7101#(<= ~counter~0 3)} ~cond := #in~cond; {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {7101#(<= ~counter~0 3)} assume !(0 == ~cond); {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {7101#(<= ~counter~0 3)} assume true; {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,083 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7101#(<= ~counter~0 3)} {7101#(<= ~counter~0 3)} #40#return; {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {7101#(<= ~counter~0 3)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7101#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:36,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {7101#(<= ~counter~0 3)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {7126#(<= ~counter~0 4)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,084 INFO L272 TraceCheckUtils]: 28: Hoare triple {7126#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {7126#(<= ~counter~0 4)} ~cond := #in~cond; {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {7126#(<= ~counter~0 4)} assume !(0 == ~cond); {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {7126#(<= ~counter~0 4)} assume true; {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,085 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7126#(<= ~counter~0 4)} {7126#(<= ~counter~0 4)} #40#return; {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {7126#(<= ~counter~0 4)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7126#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:36,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {7126#(<= ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {7151#(<= ~counter~0 5)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,087 INFO L272 TraceCheckUtils]: 36: Hoare triple {7151#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {7151#(<= ~counter~0 5)} ~cond := #in~cond; {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {7151#(<= ~counter~0 5)} assume !(0 == ~cond); {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {7151#(<= ~counter~0 5)} assume true; {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,090 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7151#(<= ~counter~0 5)} {7151#(<= ~counter~0 5)} #40#return; {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {7151#(<= ~counter~0 5)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7151#(<= ~counter~0 5)} is VALID [2022-02-20 17:41:36,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {7151#(<= ~counter~0 5)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {7176#(<= ~counter~0 6)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,092 INFO L272 TraceCheckUtils]: 44: Hoare triple {7176#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {7176#(<= ~counter~0 6)} ~cond := #in~cond; {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {7176#(<= ~counter~0 6)} assume !(0 == ~cond); {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {7176#(<= ~counter~0 6)} assume true; {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,098 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7176#(<= ~counter~0 6)} {7176#(<= ~counter~0 6)} #40#return; {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {7176#(<= ~counter~0 6)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7176#(<= ~counter~0 6)} is VALID [2022-02-20 17:41:36,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {7176#(<= ~counter~0 6)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {7201#(<= ~counter~0 7)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,099 INFO L272 TraceCheckUtils]: 52: Hoare triple {7201#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {7201#(<= ~counter~0 7)} ~cond := #in~cond; {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {7201#(<= ~counter~0 7)} assume !(0 == ~cond); {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {7201#(<= ~counter~0 7)} assume true; {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,101 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7201#(<= ~counter~0 7)} {7201#(<= ~counter~0 7)} #40#return; {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {7201#(<= ~counter~0 7)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7201#(<= ~counter~0 7)} is VALID [2022-02-20 17:41:36,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {7201#(<= ~counter~0 7)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {7226#(<= ~counter~0 8)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,102 INFO L272 TraceCheckUtils]: 60: Hoare triple {7226#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {7226#(<= ~counter~0 8)} ~cond := #in~cond; {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {7226#(<= ~counter~0 8)} assume !(0 == ~cond); {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {7226#(<= ~counter~0 8)} assume true; {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,104 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7226#(<= ~counter~0 8)} {7226#(<= ~counter~0 8)} #40#return; {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {7226#(<= ~counter~0 8)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7226#(<= ~counter~0 8)} is VALID [2022-02-20 17:41:36,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {7226#(<= ~counter~0 8)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {7251#(<= ~counter~0 9)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,113 INFO L272 TraceCheckUtils]: 68: Hoare triple {7251#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {7251#(<= ~counter~0 9)} ~cond := #in~cond; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {7251#(<= ~counter~0 9)} assume !(0 == ~cond); {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {7251#(<= ~counter~0 9)} assume true; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,115 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7251#(<= ~counter~0 9)} {7251#(<= ~counter~0 9)} #40#return; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {7251#(<= ~counter~0 9)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {7251#(<= ~counter~0 9)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {7276#(<= ~counter~0 10)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,117 INFO L272 TraceCheckUtils]: 76: Hoare triple {7276#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {7276#(<= ~counter~0 10)} ~cond := #in~cond; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,118 INFO L290 TraceCheckUtils]: 78: Hoare triple {7276#(<= ~counter~0 10)} assume !(0 == ~cond); {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {7276#(<= ~counter~0 10)} assume true; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,118 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7276#(<= ~counter~0 10)} {7276#(<= ~counter~0 10)} #40#return; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {7276#(<= ~counter~0 10)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,119 INFO L290 TraceCheckUtils]: 82: Hoare triple {7276#(<= ~counter~0 10)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7301#(<= |ULTIMATE.start_main_#t~post5#1| 10)} is VALID [2022-02-20 17:41:36,120 INFO L290 TraceCheckUtils]: 83: Hoare triple {7301#(<= |ULTIMATE.start_main_#t~post5#1| 10)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7040#false} is VALID [2022-02-20 17:41:36,120 INFO L272 TraceCheckUtils]: 84: Hoare triple {7040#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7040#false} is VALID [2022-02-20 17:41:36,120 INFO L290 TraceCheckUtils]: 85: Hoare triple {7040#false} ~cond := #in~cond; {7040#false} is VALID [2022-02-20 17:41:36,120 INFO L290 TraceCheckUtils]: 86: Hoare triple {7040#false} assume 0 == ~cond; {7040#false} is VALID [2022-02-20 17:41:36,120 INFO L290 TraceCheckUtils]: 87: Hoare triple {7040#false} assume !false; {7040#false} is VALID [2022-02-20 17:41:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:36,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:36,711 INFO L290 TraceCheckUtils]: 87: Hoare triple {7040#false} assume !false; {7040#false} is VALID [2022-02-20 17:41:36,711 INFO L290 TraceCheckUtils]: 86: Hoare triple {7040#false} assume 0 == ~cond; {7040#false} is VALID [2022-02-20 17:41:36,711 INFO L290 TraceCheckUtils]: 85: Hoare triple {7040#false} ~cond := #in~cond; {7040#false} is VALID [2022-02-20 17:41:36,712 INFO L272 TraceCheckUtils]: 84: Hoare triple {7040#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7040#false} is VALID [2022-02-20 17:41:36,712 INFO L290 TraceCheckUtils]: 83: Hoare triple {7329#(< |ULTIMATE.start_main_#t~post5#1| 20)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7040#false} is VALID [2022-02-20 17:41:36,712 INFO L290 TraceCheckUtils]: 82: Hoare triple {7333#(< ~counter~0 20)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7329#(< |ULTIMATE.start_main_#t~post5#1| 20)} is VALID [2022-02-20 17:41:36,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {7333#(< ~counter~0 20)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7333#(< ~counter~0 20)} is VALID [2022-02-20 17:41:36,713 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7039#true} {7333#(< ~counter~0 20)} #40#return; {7333#(< ~counter~0 20)} is VALID [2022-02-20 17:41:36,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,713 INFO L272 TraceCheckUtils]: 76: Hoare triple {7333#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {7333#(< ~counter~0 20)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7333#(< ~counter~0 20)} is VALID [2022-02-20 17:41:36,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {7358#(< ~counter~0 19)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7333#(< ~counter~0 20)} is VALID [2022-02-20 17:41:36,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {7358#(< ~counter~0 19)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7358#(< ~counter~0 19)} is VALID [2022-02-20 17:41:36,715 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7039#true} {7358#(< ~counter~0 19)} #40#return; {7358#(< ~counter~0 19)} is VALID [2022-02-20 17:41:36,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,715 INFO L272 TraceCheckUtils]: 68: Hoare triple {7358#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,716 INFO L290 TraceCheckUtils]: 67: Hoare triple {7358#(< ~counter~0 19)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7358#(< ~counter~0 19)} is VALID [2022-02-20 17:41:36,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {7383#(< ~counter~0 18)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7358#(< ~counter~0 19)} is VALID [2022-02-20 17:41:36,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {7383#(< ~counter~0 18)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7383#(< ~counter~0 18)} is VALID [2022-02-20 17:41:36,717 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7039#true} {7383#(< ~counter~0 18)} #40#return; {7383#(< ~counter~0 18)} is VALID [2022-02-20 17:41:36,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,717 INFO L272 TraceCheckUtils]: 60: Hoare triple {7383#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {7383#(< ~counter~0 18)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7383#(< ~counter~0 18)} is VALID [2022-02-20 17:41:36,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {7408#(< ~counter~0 17)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7383#(< ~counter~0 18)} is VALID [2022-02-20 17:41:36,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {7408#(< ~counter~0 17)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7408#(< ~counter~0 17)} is VALID [2022-02-20 17:41:36,729 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7039#true} {7408#(< ~counter~0 17)} #40#return; {7408#(< ~counter~0 17)} is VALID [2022-02-20 17:41:36,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,730 INFO L272 TraceCheckUtils]: 52: Hoare triple {7408#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {7408#(< ~counter~0 17)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7408#(< ~counter~0 17)} is VALID [2022-02-20 17:41:36,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {7433#(< ~counter~0 16)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7408#(< ~counter~0 17)} is VALID [2022-02-20 17:41:36,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {7433#(< ~counter~0 16)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7433#(< ~counter~0 16)} is VALID [2022-02-20 17:41:36,731 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7039#true} {7433#(< ~counter~0 16)} #40#return; {7433#(< ~counter~0 16)} is VALID [2022-02-20 17:41:36,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,732 INFO L272 TraceCheckUtils]: 44: Hoare triple {7433#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {7433#(< ~counter~0 16)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7433#(< ~counter~0 16)} is VALID [2022-02-20 17:41:36,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {7458#(< ~counter~0 15)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7433#(< ~counter~0 16)} is VALID [2022-02-20 17:41:36,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {7458#(< ~counter~0 15)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7458#(< ~counter~0 15)} is VALID [2022-02-20 17:41:36,734 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7039#true} {7458#(< ~counter~0 15)} #40#return; {7458#(< ~counter~0 15)} is VALID [2022-02-20 17:41:36,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,734 INFO L272 TraceCheckUtils]: 36: Hoare triple {7458#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {7458#(< ~counter~0 15)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7458#(< ~counter~0 15)} is VALID [2022-02-20 17:41:36,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {7483#(< ~counter~0 14)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7458#(< ~counter~0 15)} is VALID [2022-02-20 17:41:36,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {7483#(< ~counter~0 14)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7483#(< ~counter~0 14)} is VALID [2022-02-20 17:41:36,736 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7039#true} {7483#(< ~counter~0 14)} #40#return; {7483#(< ~counter~0 14)} is VALID [2022-02-20 17:41:36,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,736 INFO L272 TraceCheckUtils]: 28: Hoare triple {7483#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {7483#(< ~counter~0 14)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7483#(< ~counter~0 14)} is VALID [2022-02-20 17:41:36,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {7508#(< ~counter~0 13)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7483#(< ~counter~0 14)} is VALID [2022-02-20 17:41:36,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {7508#(< ~counter~0 13)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7508#(< ~counter~0 13)} is VALID [2022-02-20 17:41:36,738 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7039#true} {7508#(< ~counter~0 13)} #40#return; {7508#(< ~counter~0 13)} is VALID [2022-02-20 17:41:36,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,739 INFO L272 TraceCheckUtils]: 20: Hoare triple {7508#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {7508#(< ~counter~0 13)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7508#(< ~counter~0 13)} is VALID [2022-02-20 17:41:36,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {7533#(< ~counter~0 12)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7508#(< ~counter~0 13)} is VALID [2022-02-20 17:41:36,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {7533#(< ~counter~0 12)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7533#(< ~counter~0 12)} is VALID [2022-02-20 17:41:36,740 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7039#true} {7533#(< ~counter~0 12)} #40#return; {7533#(< ~counter~0 12)} is VALID [2022-02-20 17:41:36,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,741 INFO L272 TraceCheckUtils]: 12: Hoare triple {7533#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {7533#(< ~counter~0 12)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7533#(< ~counter~0 12)} is VALID [2022-02-20 17:41:36,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {7276#(<= ~counter~0 10)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7533#(< ~counter~0 12)} is VALID [2022-02-20 17:41:36,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {7276#(<= ~counter~0 10)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,743 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7039#true} {7276#(<= ~counter~0 10)} #40#return; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 17:41:36,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {7039#true} assume !(0 == ~cond); {7039#true} is VALID [2022-02-20 17:41:36,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {7039#true} ~cond := #in~cond; {7039#true} is VALID [2022-02-20 17:41:36,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {7276#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7039#true} is VALID [2022-02-20 17:41:36,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {7276#(<= ~counter~0 10)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {7251#(<= ~counter~0 9)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7276#(<= ~counter~0 10)} is VALID [2022-02-20 17:41:36,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {7251#(<= ~counter~0 9)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {7039#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7251#(<= ~counter~0 9)} is VALID [2022-02-20 17:41:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 17:41:36,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:36,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377422138] [2022-02-20 17:41:36,748 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:36,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340085340] [2022-02-20 17:41:36,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340085340] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:36,748 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:36,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-02-20 17:41:36,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739847512] [2022-02-20 17:41:36,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:36,749 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 88 [2022-02-20 17:41:36,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:36,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-02-20 17:41:36,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:36,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 17:41:36,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 17:41:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:41:36,860 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-02-20 17:41:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:37,741 INFO L93 Difference]: Finished difference Result 219 states and 229 transitions. [2022-02-20 17:41:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-20 17:41:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 88 [2022-02-20 17:41:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-02-20 17:41:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 219 transitions. [2022-02-20 17:41:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-02-20 17:41:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 219 transitions. [2022-02-20 17:41:37,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 219 transitions. [2022-02-20 17:41:37,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:37,946 INFO L225 Difference]: With dead ends: 219 [2022-02-20 17:41:37,947 INFO L226 Difference]: Without dead ends: 214 [2022-02-20 17:41:37,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-02-20 17:41:37,948 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 150 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:37,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 184 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-20 17:41:38,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 169. [2022-02-20 17:41:38,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:38,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 169 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 127 states have internal predecessors, (138), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:38,022 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 169 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 127 states have internal predecessors, (138), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:38,022 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 169 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 127 states have internal predecessors, (138), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:38,027 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-02-20 17:41:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2022-02-20 17:41:38,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:38,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:38,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 127 states have internal predecessors, (138), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 214 states. [2022-02-20 17:41:38,028 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 127 states have internal predecessors, (138), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 214 states. [2022-02-20 17:41:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:38,032 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-02-20 17:41:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2022-02-20 17:41:38,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:38,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:38,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:38,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 127 states have internal predecessors, (138), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2022-02-20 17:41:38,037 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 88 [2022-02-20 17:41:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:38,037 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2022-02-20 17:41:38,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-02-20 17:41:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-02-20 17:41:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 17:41:38,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:38,038 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:38,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:38,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 17:41:38,245 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash 53411800, now seen corresponding path program 10 times [2022-02-20 17:41:38,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:38,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2432953] [2022-02-20 17:41:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:38,258 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:38,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437818543] [2022-02-20 17:41:38,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:41:38,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:38,260 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:38,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-20 17:41:39,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:41:39,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:39,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 17:41:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:39,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:39,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {8587#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8587#true} is VALID [2022-02-20 17:41:39,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {8587#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:39,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:39,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:39,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,846 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8587#true} {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:39,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {8595#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:39,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:39,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:39,848 INFO L272 TraceCheckUtils]: 12: Hoare triple {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,849 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8587#true} {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:39,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {8620#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,851 INFO L272 TraceCheckUtils]: 20: Hoare triple {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,852 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8587#true} {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {8645#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,854 INFO L272 TraceCheckUtils]: 28: Hoare triple {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,855 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8587#true} {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} #40#return; {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {8670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:39,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:39,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:39,857 INFO L272 TraceCheckUtils]: 36: Hoare triple {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,858 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8587#true} {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:39,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {8695#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,860 INFO L272 TraceCheckUtils]: 44: Hoare triple {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,861 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8587#true} {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #40#return; {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:39,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {8720#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,863 INFO L272 TraceCheckUtils]: 52: Hoare triple {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,864 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8587#true} {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {8745#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:39,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:39,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:39,866 INFO L272 TraceCheckUtils]: 60: Hoare triple {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,867 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8587#true} {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:39,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {8770#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,868 INFO L290 TraceCheckUtils]: 66: Hoare triple {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,868 INFO L290 TraceCheckUtils]: 67: Hoare triple {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,869 INFO L272 TraceCheckUtils]: 68: Hoare triple {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,869 INFO L290 TraceCheckUtils]: 71: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,870 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8587#true} {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:39,870 INFO L290 TraceCheckUtils]: 73: Hoare triple {8795#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:39,871 INFO L290 TraceCheckUtils]: 74: Hoare triple {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:39,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:39,871 INFO L272 TraceCheckUtils]: 76: Hoare triple {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,872 INFO L290 TraceCheckUtils]: 77: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,872 INFO L290 TraceCheckUtils]: 78: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,872 INFO L290 TraceCheckUtils]: 79: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,873 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8587#true} {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} #40#return; {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:39,873 INFO L290 TraceCheckUtils]: 81: Hoare triple {8820#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:39,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:39,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:39,874 INFO L272 TraceCheckUtils]: 84: Hoare triple {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8587#true} is VALID [2022-02-20 17:41:39,874 INFO L290 TraceCheckUtils]: 85: Hoare triple {8587#true} ~cond := #in~cond; {8587#true} is VALID [2022-02-20 17:41:39,875 INFO L290 TraceCheckUtils]: 86: Hoare triple {8587#true} assume !(0 == ~cond); {8587#true} is VALID [2022-02-20 17:41:39,875 INFO L290 TraceCheckUtils]: 87: Hoare triple {8587#true} assume true; {8587#true} is VALID [2022-02-20 17:41:39,875 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8587#true} {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} #40#return; {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:39,876 INFO L290 TraceCheckUtils]: 89: Hoare triple {8845#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !(main_~c~0#1 < main_~k~0#1); {8870#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:39,877 INFO L272 TraceCheckUtils]: 90: Hoare triple {8870#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:39,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {8874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:39,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {8878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8588#false} is VALID [2022-02-20 17:41:39,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {8588#false} assume !false; {8588#false} is VALID [2022-02-20 17:41:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 22 proven. 220 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 17:41:39,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:40,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:40,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2432953] [2022-02-20 17:41:40,221 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:40,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437818543] [2022-02-20 17:41:40,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437818543] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:40,222 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:40,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-02-20 17:41:40,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961083155] [2022-02-20 17:41:40,222 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:40,223 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 94 [2022-02-20 17:41:40,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:40,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:40,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:40,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:41:40,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:41:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:41:40,288 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:41,488 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2022-02-20 17:41:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:41:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 94 [2022-02-20 17:41:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-02-20 17:41:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-02-20 17:41:41,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 75 transitions. [2022-02-20 17:41:41,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:41,569 INFO L225 Difference]: With dead ends: 174 [2022-02-20 17:41:41,570 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 17:41:41,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:41:41,571 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:41,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 628 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:41:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 17:41:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 17:41:41,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:41,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.078740157480315) internal successors, (137), 127 states have internal predecessors, (137), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:41,646 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.078740157480315) internal successors, (137), 127 states have internal predecessors, (137), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:41,646 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.078740157480315) internal successors, (137), 127 states have internal predecessors, (137), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:41,650 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-02-20 17:41:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2022-02-20 17:41:41,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:41,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:41,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.078740157480315) internal successors, (137), 127 states have internal predecessors, (137), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:41,651 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.078740157480315) internal successors, (137), 127 states have internal predecessors, (137), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:41,654 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-02-20 17:41:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2022-02-20 17:41:41,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:41,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:41,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:41,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.078740157480315) internal successors, (137), 127 states have internal predecessors, (137), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2022-02-20 17:41:41,659 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 94 [2022-02-20 17:41:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:41,659 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2022-02-20 17:41:41,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2022-02-20 17:41:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 17:41:41,660 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:41,660 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:41,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-02-20 17:41:41,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 17:41:41,866 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:41,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash 983788606, now seen corresponding path program 11 times [2022-02-20 17:41:41,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:41,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122717346] [2022-02-20 17:41:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:41,881 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:41,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272223054] [2022-02-20 17:41:41,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:41:41,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:41,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:41,883 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:41,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-20 17:41:42,306 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-02-20 17:41:42,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:42,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-20 17:41:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:42,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:42,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {9742#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9742#true} is VALID [2022-02-20 17:41:42,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {9742#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:42,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:42,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:42,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,975 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {9742#true} {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:42,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {9750#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:42,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:42,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:42,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,977 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9742#true} {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:42,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {9775#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:42,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:42,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:42,979 INFO L272 TraceCheckUtils]: 20: Hoare triple {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,979 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9742#true} {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:42,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {9800#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:42,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:42,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:42,982 INFO L272 TraceCheckUtils]: 28: Hoare triple {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,982 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9742#true} {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:42,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {9825#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,984 INFO L272 TraceCheckUtils]: 36: Hoare triple {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,984 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9742#true} {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #40#return; {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {9850#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,986 INFO L272 TraceCheckUtils]: 44: Hoare triple {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,986 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9742#true} {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} #40#return; {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {9875#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,988 INFO L272 TraceCheckUtils]: 52: Hoare triple {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,988 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {9742#true} {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} #40#return; {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:42,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {9900#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,990 INFO L272 TraceCheckUtils]: 60: Hoare triple {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,990 INFO L290 TraceCheckUtils]: 63: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,990 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9742#true} {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} #40#return; {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {9925#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:42,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:42,992 INFO L290 TraceCheckUtils]: 67: Hoare triple {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:42,992 INFO L272 TraceCheckUtils]: 68: Hoare triple {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,992 INFO L290 TraceCheckUtils]: 69: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,992 INFO L290 TraceCheckUtils]: 70: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,992 INFO L290 TraceCheckUtils]: 71: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,992 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {9742#true} {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:42,993 INFO L290 TraceCheckUtils]: 73: Hoare triple {9950#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,993 INFO L290 TraceCheckUtils]: 74: Hoare triple {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,994 INFO L290 TraceCheckUtils]: 75: Hoare triple {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,994 INFO L272 TraceCheckUtils]: 76: Hoare triple {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,994 INFO L290 TraceCheckUtils]: 77: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,994 INFO L290 TraceCheckUtils]: 78: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,994 INFO L290 TraceCheckUtils]: 79: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,994 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9742#true} {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} #40#return; {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:42,995 INFO L290 TraceCheckUtils]: 81: Hoare triple {9975#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:41:42,995 INFO L290 TraceCheckUtils]: 82: Hoare triple {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:41:42,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:41:42,996 INFO L272 TraceCheckUtils]: 84: Hoare triple {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,996 INFO L290 TraceCheckUtils]: 87: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,996 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9742#true} {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} #40#return; {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:41:42,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {10000#(and (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= |ULTIMATE.start_main_~c~0#1| 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} is VALID [2022-02-20 17:41:42,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} is VALID [2022-02-20 17:41:42,997 INFO L290 TraceCheckUtils]: 91: Hoare triple {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} is VALID [2022-02-20 17:41:42,998 INFO L272 TraceCheckUtils]: 92: Hoare triple {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9742#true} is VALID [2022-02-20 17:41:42,998 INFO L290 TraceCheckUtils]: 93: Hoare triple {9742#true} ~cond := #in~cond; {9742#true} is VALID [2022-02-20 17:41:42,998 INFO L290 TraceCheckUtils]: 94: Hoare triple {9742#true} assume !(0 == ~cond); {9742#true} is VALID [2022-02-20 17:41:42,998 INFO L290 TraceCheckUtils]: 95: Hoare triple {9742#true} assume true; {9742#true} is VALID [2022-02-20 17:41:42,998 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9742#true} {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} #40#return; {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} is VALID [2022-02-20 17:41:42,999 INFO L290 TraceCheckUtils]: 97: Hoare triple {10025#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 11) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))))} assume !(main_~c~0#1 < main_~k~0#1); {10050#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (<= |ULTIMATE.start_main_~k~0#1| 11))} is VALID [2022-02-20 17:41:43,000 INFO L272 TraceCheckUtils]: 98: Hoare triple {10050#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (<= |ULTIMATE.start_main_~k~0#1| 11))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:43,000 INFO L290 TraceCheckUtils]: 99: Hoare triple {10054#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:43,000 INFO L290 TraceCheckUtils]: 100: Hoare triple {10058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9743#false} is VALID [2022-02-20 17:41:43,000 INFO L290 TraceCheckUtils]: 101: Hoare triple {9743#false} assume !false; {9743#false} is VALID [2022-02-20 17:41:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-20 17:41:43,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:43,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:43,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122717346] [2022-02-20 17:41:43,318 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:43,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272223054] [2022-02-20 17:41:43,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272223054] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:43,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:43,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-02-20 17:41:43,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648860866] [2022-02-20 17:41:43,318 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 102 [2022-02-20 17:41:43,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:43,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:41:43,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:43,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 17:41:43,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 17:41:43,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:41:43,380 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:41:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:44,625 INFO L93 Difference]: Finished difference Result 174 states and 182 transitions. [2022-02-20 17:41:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 17:41:44,626 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 102 [2022-02-20 17:41:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:41:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-02-20 17:41:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:41:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-02-20 17:41:44,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 80 transitions. [2022-02-20 17:41:44,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:44,715 INFO L225 Difference]: With dead ends: 174 [2022-02-20 17:41:44,715 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 17:41:44,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:41:44,716 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:44,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 718 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:41:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 17:41:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 17:41:44,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:44,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:44,807 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:44,807 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:44,810 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2022-02-20 17:41:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 177 transitions. [2022-02-20 17:41:44,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:44,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:44,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:44,811 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:44,814 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2022-02-20 17:41:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 177 transitions. [2022-02-20 17:41:44,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:44,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:44,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:44,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 177 transitions. [2022-02-20 17:41:44,818 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 177 transitions. Word has length 102 [2022-02-20 17:41:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:44,819 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 177 transitions. [2022-02-20 17:41:44,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:41:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 177 transitions. [2022-02-20 17:41:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-20 17:41:44,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:44,820 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:44,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:45,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 17:41:45,030 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1339026780, now seen corresponding path program 12 times [2022-02-20 17:41:45,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:45,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402039289] [2022-02-20 17:41:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:45,048 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:45,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434557010] [2022-02-20 17:41:45,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:41:45,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:45,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:45,051 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:45,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-20 17:41:45,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-02-20 17:41:45,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:45,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-20 17:41:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:45,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:46,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {10922#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10922#true} is VALID [2022-02-20 17:41:46,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {10922#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:46,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:46,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:46,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,173 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10922#true} {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:46,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {10930#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:46,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:46,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:46,174 INFO L272 TraceCheckUtils]: 12: Hoare triple {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,175 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10922#true} {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:46,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {10955#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,176 INFO L272 TraceCheckUtils]: 20: Hoare triple {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,177 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10922#true} {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {10980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,178 INFO L272 TraceCheckUtils]: 28: Hoare triple {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,179 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10922#true} {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {11005#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,180 INFO L272 TraceCheckUtils]: 36: Hoare triple {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,181 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10922#true} {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:46,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {11030#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:46,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:46,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:46,182 INFO L272 TraceCheckUtils]: 44: Hoare triple {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,183 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10922#true} {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #40#return; {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:46,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {11055#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,184 INFO L272 TraceCheckUtils]: 52: Hoare triple {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,185 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10922#true} {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {11080#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,186 INFO L272 TraceCheckUtils]: 60: Hoare triple {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,187 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10922#true} {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:46,187 INFO L290 TraceCheckUtils]: 65: Hoare triple {11105#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:46,188 INFO L290 TraceCheckUtils]: 66: Hoare triple {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:46,188 INFO L290 TraceCheckUtils]: 67: Hoare triple {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:46,188 INFO L272 TraceCheckUtils]: 68: Hoare triple {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,188 INFO L290 TraceCheckUtils]: 69: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,188 INFO L290 TraceCheckUtils]: 71: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,189 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {10922#true} {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} #40#return; {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:46,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {11130#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:46,190 INFO L290 TraceCheckUtils]: 74: Hoare triple {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:46,190 INFO L290 TraceCheckUtils]: 75: Hoare triple {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:46,190 INFO L272 TraceCheckUtils]: 76: Hoare triple {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,191 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10922#true} {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} #40#return; {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:46,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {11155#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:46,192 INFO L290 TraceCheckUtils]: 82: Hoare triple {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:46,192 INFO L290 TraceCheckUtils]: 83: Hoare triple {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:46,192 INFO L272 TraceCheckUtils]: 84: Hoare triple {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,192 INFO L290 TraceCheckUtils]: 87: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,193 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10922#true} {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} #40#return; {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:46,193 INFO L290 TraceCheckUtils]: 89: Hoare triple {11180#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:46,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:46,194 INFO L290 TraceCheckUtils]: 91: Hoare triple {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:46,194 INFO L272 TraceCheckUtils]: 92: Hoare triple {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,194 INFO L290 TraceCheckUtils]: 93: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,194 INFO L290 TraceCheckUtils]: 94: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,194 INFO L290 TraceCheckUtils]: 95: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,195 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10922#true} {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} #40#return; {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:46,195 INFO L290 TraceCheckUtils]: 97: Hoare triple {11205#(and (= |ULTIMATE.start_main_~y~0#1| 11) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:46,196 INFO L290 TraceCheckUtils]: 98: Hoare triple {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:46,196 INFO L290 TraceCheckUtils]: 99: Hoare triple {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:46,196 INFO L272 TraceCheckUtils]: 100: Hoare triple {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10922#true} is VALID [2022-02-20 17:41:46,196 INFO L290 TraceCheckUtils]: 101: Hoare triple {10922#true} ~cond := #in~cond; {10922#true} is VALID [2022-02-20 17:41:46,196 INFO L290 TraceCheckUtils]: 102: Hoare triple {10922#true} assume !(0 == ~cond); {10922#true} is VALID [2022-02-20 17:41:46,196 INFO L290 TraceCheckUtils]: 103: Hoare triple {10922#true} assume true; {10922#true} is VALID [2022-02-20 17:41:46,197 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10922#true} {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} #40#return; {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:46,197 INFO L290 TraceCheckUtils]: 105: Hoare triple {11230#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} assume !(main_~c~0#1 < main_~k~0#1); {11255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 12))} is VALID [2022-02-20 17:41:46,198 INFO L272 TraceCheckUtils]: 106: Hoare triple {11255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 12))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {11259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:46,198 INFO L290 TraceCheckUtils]: 107: Hoare triple {11259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:46,199 INFO L290 TraceCheckUtils]: 108: Hoare triple {11263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10923#false} is VALID [2022-02-20 17:41:46,199 INFO L290 TraceCheckUtils]: 109: Hoare triple {10923#false} assume !false; {10923#false} is VALID [2022-02-20 17:41:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 26 proven. 312 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-02-20 17:41:46,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:46,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:46,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402039289] [2022-02-20 17:41:46,662 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:46,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434557010] [2022-02-20 17:41:46,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434557010] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:46,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:46,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-02-20 17:41:46,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927645552] [2022-02-20 17:41:46,662 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:46,663 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 110 [2022-02-20 17:41:46,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:46,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:41:46,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:46,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 17:41:46,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 17:41:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:41:46,729 INFO L87 Difference]: Start difference. First operand 169 states and 177 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:41:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:48,217 INFO L93 Difference]: Finished difference Result 174 states and 181 transitions. [2022-02-20 17:41:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 17:41:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 110 [2022-02-20 17:41:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:41:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 85 transitions. [2022-02-20 17:41:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:41:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 85 transitions. [2022-02-20 17:41:48,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 85 transitions. [2022-02-20 17:41:48,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:48,311 INFO L225 Difference]: With dead ends: 174 [2022-02-20 17:41:48,311 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 17:41:48,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:41:48,312 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:48,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 814 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:41:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 17:41:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 17:41:48,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:48,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.062992125984252) internal successors, (135), 127 states have internal predecessors, (135), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:48,395 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.062992125984252) internal successors, (135), 127 states have internal predecessors, (135), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:48,395 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.062992125984252) internal successors, (135), 127 states have internal predecessors, (135), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:48,398 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2022-02-20 17:41:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2022-02-20 17:41:48,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:48,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:48,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.062992125984252) internal successors, (135), 127 states have internal predecessors, (135), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:48,400 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.062992125984252) internal successors, (135), 127 states have internal predecessors, (135), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:48,403 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2022-02-20 17:41:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2022-02-20 17:41:48,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:48,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:48,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:48,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.062992125984252) internal successors, (135), 127 states have internal predecessors, (135), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2022-02-20 17:41:48,407 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 110 [2022-02-20 17:41:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:48,407 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2022-02-20 17:41:48,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:41:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2022-02-20 17:41:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-20 17:41:48,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:48,409 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:48,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:48,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:48,616 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1291514634, now seen corresponding path program 13 times [2022-02-20 17:41:48,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:48,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577153116] [2022-02-20 17:41:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:48,631 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:48,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526099435] [2022-02-20 17:41:48,631 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:41:48,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:48,633 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:48,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-20 17:41:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:49,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-20 17:41:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:49,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:49,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {12127#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12127#true} is VALID [2022-02-20 17:41:49,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {12127#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:49,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:49,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:49,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,918 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12127#true} {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:49,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {12135#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:49,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:49,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:49,919 INFO L272 TraceCheckUtils]: 12: Hoare triple {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,920 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12127#true} {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:49,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {12160#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,921 INFO L272 TraceCheckUtils]: 20: Hoare triple {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,922 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12127#true} {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {12185#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,923 INFO L272 TraceCheckUtils]: 28: Hoare triple {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,927 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12127#true} {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:49,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {12210#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:49,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:49,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:49,930 INFO L272 TraceCheckUtils]: 36: Hoare triple {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,931 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12127#true} {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:49,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {12235#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:49,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:49,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:49,932 INFO L272 TraceCheckUtils]: 44: Hoare triple {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,933 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12127#true} {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:49,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {12260#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:49,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:49,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:49,935 INFO L272 TraceCheckUtils]: 52: Hoare triple {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,936 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12127#true} {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} #40#return; {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:49,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {12285#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:49,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:49,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:49,937 INFO L272 TraceCheckUtils]: 60: Hoare triple {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,938 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12127#true} {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #40#return; {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:49,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {12310#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:49,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:49,939 INFO L290 TraceCheckUtils]: 67: Hoare triple {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:49,939 INFO L272 TraceCheckUtils]: 68: Hoare triple {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,940 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12127#true} {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} #40#return; {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:41:49,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {12335#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:49,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:49,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:49,941 INFO L272 TraceCheckUtils]: 76: Hoare triple {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,941 INFO L290 TraceCheckUtils]: 77: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,941 INFO L290 TraceCheckUtils]: 78: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,941 INFO L290 TraceCheckUtils]: 79: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,942 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12127#true} {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} #40#return; {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:41:49,942 INFO L290 TraceCheckUtils]: 81: Hoare triple {12360#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:49,943 INFO L290 TraceCheckUtils]: 82: Hoare triple {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:49,943 INFO L290 TraceCheckUtils]: 83: Hoare triple {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:49,943 INFO L272 TraceCheckUtils]: 84: Hoare triple {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,943 INFO L290 TraceCheckUtils]: 85: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,943 INFO L290 TraceCheckUtils]: 86: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,943 INFO L290 TraceCheckUtils]: 87: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,950 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12127#true} {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} #40#return; {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:49,951 INFO L290 TraceCheckUtils]: 89: Hoare triple {12385#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,951 INFO L290 TraceCheckUtils]: 90: Hoare triple {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,952 INFO L290 TraceCheckUtils]: 91: Hoare triple {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,952 INFO L272 TraceCheckUtils]: 92: Hoare triple {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,952 INFO L290 TraceCheckUtils]: 93: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,952 INFO L290 TraceCheckUtils]: 94: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,952 INFO L290 TraceCheckUtils]: 95: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,952 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {12127#true} {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} #40#return; {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,953 INFO L290 TraceCheckUtils]: 97: Hoare triple {12410#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,953 INFO L290 TraceCheckUtils]: 98: Hoare triple {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,954 INFO L290 TraceCheckUtils]: 99: Hoare triple {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,954 INFO L272 TraceCheckUtils]: 100: Hoare triple {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,954 INFO L290 TraceCheckUtils]: 101: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,954 INFO L290 TraceCheckUtils]: 102: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,954 INFO L290 TraceCheckUtils]: 103: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,954 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12127#true} {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} #40#return; {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,955 INFO L290 TraceCheckUtils]: 105: Hoare triple {12435#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:49,955 INFO L290 TraceCheckUtils]: 106: Hoare triple {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:49,956 INFO L290 TraceCheckUtils]: 107: Hoare triple {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:49,956 INFO L272 TraceCheckUtils]: 108: Hoare triple {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12127#true} is VALID [2022-02-20 17:41:49,956 INFO L290 TraceCheckUtils]: 109: Hoare triple {12127#true} ~cond := #in~cond; {12127#true} is VALID [2022-02-20 17:41:49,956 INFO L290 TraceCheckUtils]: 110: Hoare triple {12127#true} assume !(0 == ~cond); {12127#true} is VALID [2022-02-20 17:41:49,956 INFO L290 TraceCheckUtils]: 111: Hoare triple {12127#true} assume true; {12127#true} is VALID [2022-02-20 17:41:49,956 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {12127#true} {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} #40#return; {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:49,957 INFO L290 TraceCheckUtils]: 113: Hoare triple {12460#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10) (<= |ULTIMATE.start_main_~c~0#1| 13))} assume !(main_~c~0#1 < main_~k~0#1); {12485#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 13) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:41:49,958 INFO L272 TraceCheckUtils]: 114: Hoare triple {12485#(and (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 13) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 10))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {12489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:49,958 INFO L290 TraceCheckUtils]: 115: Hoare triple {12489#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:49,959 INFO L290 TraceCheckUtils]: 116: Hoare triple {12493#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12128#false} is VALID [2022-02-20 17:41:49,959 INFO L290 TraceCheckUtils]: 117: Hoare triple {12128#false} assume !false; {12128#false} is VALID [2022-02-20 17:41:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 28 proven. 364 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-02-20 17:41:49,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:50,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:50,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577153116] [2022-02-20 17:41:50,334 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:50,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526099435] [2022-02-20 17:41:50,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526099435] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:50,334 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:50,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-02-20 17:41:50,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513254127] [2022-02-20 17:41:50,335 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 118 [2022-02-20 17:41:50,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:50,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:41:50,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:50,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 17:41:50,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 17:41:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:41:50,423 INFO L87 Difference]: Start difference. First operand 169 states and 176 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:41:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:52,146 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2022-02-20 17:41:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 17:41:52,146 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 118 [2022-02-20 17:41:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:41:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2022-02-20 17:41:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:41:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2022-02-20 17:41:52,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2022-02-20 17:41:52,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:52,249 INFO L225 Difference]: With dead ends: 174 [2022-02-20 17:41:52,249 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 17:41:52,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:41:52,250 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:52,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 916 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 17:41:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 17:41:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 17:41:52,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:52,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:52,336 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:52,336 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:52,339 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2022-02-20 17:41:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 175 transitions. [2022-02-20 17:41:52,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:52,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:52,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:52,340 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:52,343 INFO L93 Difference]: Finished difference Result 169 states and 175 transitions. [2022-02-20 17:41:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 175 transitions. [2022-02-20 17:41:52,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:52,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:52,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:52,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 127 states have internal predecessors, (134), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 175 transitions. [2022-02-20 17:41:52,348 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 175 transitions. Word has length 118 [2022-02-20 17:41:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:52,348 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 175 transitions. [2022-02-20 17:41:52,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:41:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 175 transitions. [2022-02-20 17:41:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-20 17:41:52,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:52,349 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:52,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:52,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:52,556 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1948913008, now seen corresponding path program 14 times [2022-02-20 17:41:52,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:52,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025140461] [2022-02-20 17:41:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:52,584 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:52,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434527842] [2022-02-20 17:41:52,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:52,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:52,586 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:52,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-20 17:41:53,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:53,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:53,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-20 17:41:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:53,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:53,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {13357#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13357#true} is VALID [2022-02-20 17:41:53,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {13357#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:53,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:53,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:53,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,800 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13357#true} {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:53,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {13365#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:53,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:53,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:53,802 INFO L272 TraceCheckUtils]: 12: Hoare triple {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,802 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13357#true} {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:53,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {13390#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:53,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:53,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:53,804 INFO L272 TraceCheckUtils]: 20: Hoare triple {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,804 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13357#true} {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:53,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {13415#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:53,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:53,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:53,806 INFO L272 TraceCheckUtils]: 28: Hoare triple {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,806 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13357#true} {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:53,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {13440#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:53,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:53,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:53,808 INFO L272 TraceCheckUtils]: 36: Hoare triple {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,808 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13357#true} {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:53,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {13465#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:53,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:53,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:53,809 INFO L272 TraceCheckUtils]: 44: Hoare triple {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,810 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13357#true} {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:53,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {13490#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:53,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:53,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:53,811 INFO L272 TraceCheckUtils]: 52: Hoare triple {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,812 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13357#true} {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} #40#return; {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:53,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {13515#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:41:53,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:41:53,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:41:53,813 INFO L272 TraceCheckUtils]: 60: Hoare triple {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,814 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13357#true} {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} #40#return; {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:41:53,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {13540#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:53,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:53,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:53,815 INFO L272 TraceCheckUtils]: 68: Hoare triple {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,816 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13357#true} {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:53,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {13565#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:41:53,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:41:53,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:41:53,817 INFO L272 TraceCheckUtils]: 76: Hoare triple {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,819 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13357#true} {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} #40#return; {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:41:53,820 INFO L290 TraceCheckUtils]: 81: Hoare triple {13590#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:53,820 INFO L290 TraceCheckUtils]: 82: Hoare triple {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:53,821 INFO L290 TraceCheckUtils]: 83: Hoare triple {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:53,821 INFO L272 TraceCheckUtils]: 84: Hoare triple {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,821 INFO L290 TraceCheckUtils]: 85: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,821 INFO L290 TraceCheckUtils]: 86: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,822 INFO L290 TraceCheckUtils]: 87: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,822 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13357#true} {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} #40#return; {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:41:53,823 INFO L290 TraceCheckUtils]: 89: Hoare triple {13615#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:41:53,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:41:53,824 INFO L290 TraceCheckUtils]: 91: Hoare triple {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:41:53,824 INFO L272 TraceCheckUtils]: 92: Hoare triple {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,825 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13357#true} {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} #40#return; {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:41:53,826 INFO L290 TraceCheckUtils]: 97: Hoare triple {13640#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:53,826 INFO L290 TraceCheckUtils]: 98: Hoare triple {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:53,827 INFO L290 TraceCheckUtils]: 99: Hoare triple {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:53,827 INFO L272 TraceCheckUtils]: 100: Hoare triple {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,827 INFO L290 TraceCheckUtils]: 101: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,827 INFO L290 TraceCheckUtils]: 102: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,827 INFO L290 TraceCheckUtils]: 103: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,828 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {13357#true} {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} #40#return; {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:41:53,828 INFO L290 TraceCheckUtils]: 105: Hoare triple {13665#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:53,829 INFO L290 TraceCheckUtils]: 106: Hoare triple {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:53,829 INFO L290 TraceCheckUtils]: 107: Hoare triple {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:53,830 INFO L272 TraceCheckUtils]: 108: Hoare triple {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,830 INFO L290 TraceCheckUtils]: 109: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,830 INFO L290 TraceCheckUtils]: 110: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,830 INFO L290 TraceCheckUtils]: 111: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,831 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {13357#true} {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} #40#return; {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:41:53,831 INFO L290 TraceCheckUtils]: 113: Hoare triple {13690#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:53,832 INFO L290 TraceCheckUtils]: 114: Hoare triple {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:53,832 INFO L290 TraceCheckUtils]: 115: Hoare triple {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:53,833 INFO L272 TraceCheckUtils]: 116: Hoare triple {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13357#true} is VALID [2022-02-20 17:41:53,833 INFO L290 TraceCheckUtils]: 117: Hoare triple {13357#true} ~cond := #in~cond; {13357#true} is VALID [2022-02-20 17:41:53,833 INFO L290 TraceCheckUtils]: 118: Hoare triple {13357#true} assume !(0 == ~cond); {13357#true} is VALID [2022-02-20 17:41:53,833 INFO L290 TraceCheckUtils]: 119: Hoare triple {13357#true} assume true; {13357#true} is VALID [2022-02-20 17:41:53,834 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {13357#true} {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} #40#return; {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:53,834 INFO L290 TraceCheckUtils]: 121: Hoare triple {13715#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {13740#(and (<= |ULTIMATE.start_main_~k~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:53,835 INFO L272 TraceCheckUtils]: 122: Hoare triple {13740#(and (<= |ULTIMATE.start_main_~k~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {13744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:53,836 INFO L290 TraceCheckUtils]: 123: Hoare triple {13744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:53,836 INFO L290 TraceCheckUtils]: 124: Hoare triple {13748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13358#false} is VALID [2022-02-20 17:41:53,836 INFO L290 TraceCheckUtils]: 125: Hoare triple {13358#false} assume !false; {13358#false} is VALID [2022-02-20 17:41:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 30 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-02-20 17:41:53,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:54,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:54,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025140461] [2022-02-20 17:41:54,177 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:54,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434527842] [2022-02-20 17:41:54,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434527842] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:54,178 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:54,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-02-20 17:41:54,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45363512] [2022-02-20 17:41:54,178 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:54,178 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 126 [2022-02-20 17:41:54,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:54,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:41:54,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:54,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 17:41:54,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 17:41:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:41:54,272 INFO L87 Difference]: Start difference. First operand 169 states and 175 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:41:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:56,244 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2022-02-20 17:41:56,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 17:41:56,245 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 126 [2022-02-20 17:41:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:41:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 95 transitions. [2022-02-20 17:41:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:41:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 95 transitions. [2022-02-20 17:41:56,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 95 transitions. [2022-02-20 17:41:56,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:56,344 INFO L225 Difference]: With dead ends: 174 [2022-02-20 17:41:56,344 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 17:41:56,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-02-20 17:41:56,345 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:56,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1024 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:41:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 17:41:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 17:41:56,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:56,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:56,432 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:56,432 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:56,435 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2022-02-20 17:41:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2022-02-20 17:41:56,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:56,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:56,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:56,436 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:41:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:56,439 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2022-02-20 17:41:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2022-02-20 17:41:56,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:56,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:56,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:56,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.047244094488189) internal successors, (133), 127 states have internal predecessors, (133), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:41:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 174 transitions. [2022-02-20 17:41:56,443 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 174 transitions. Word has length 126 [2022-02-20 17:41:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:56,443 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 174 transitions. [2022-02-20 17:41:56,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:41:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2022-02-20 17:41:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-20 17:41:56,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:56,445 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:56,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:56,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-02-20 17:41:56,651 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 48456150, now seen corresponding path program 15 times [2022-02-20 17:41:56,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:56,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386873726] [2022-02-20 17:41:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:56,667 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:56,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1054677776] [2022-02-20 17:41:56,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:56,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:56,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:56,669 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:56,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-20 17:41:57,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-02-20 17:41:57,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:57,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-20 17:41:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:57,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:58,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {14612#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14612#true} is VALID [2022-02-20 17:41:58,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {14612#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:58,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:58,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:58,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,299 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14612#true} {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:58,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {14620#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:58,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:58,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:58,300 INFO L272 TraceCheckUtils]: 12: Hoare triple {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,301 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14612#true} {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:58,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {14645#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:58,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:58,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:58,302 INFO L272 TraceCheckUtils]: 20: Hoare triple {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,303 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14612#true} {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #40#return; {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:58,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {14670#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,304 INFO L272 TraceCheckUtils]: 28: Hoare triple {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,305 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14612#true} {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #40#return; {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {14695#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:58,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:58,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:58,306 INFO L272 TraceCheckUtils]: 36: Hoare triple {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,307 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14612#true} {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:58,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {14720#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,308 INFO L272 TraceCheckUtils]: 44: Hoare triple {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,309 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14612#true} {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {14745#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,310 INFO L272 TraceCheckUtils]: 52: Hoare triple {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,311 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14612#true} {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {14770#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,312 INFO L272 TraceCheckUtils]: 60: Hoare triple {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,313 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14612#true} {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:58,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {14795#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,314 INFO L272 TraceCheckUtils]: 68: Hoare triple {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,315 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14612#true} {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {14820#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 4) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:58,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:58,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:58,316 INFO L272 TraceCheckUtils]: 76: Hoare triple {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,316 INFO L290 TraceCheckUtils]: 79: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,317 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14612#true} {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} #40#return; {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:58,317 INFO L290 TraceCheckUtils]: 81: Hoare triple {14845#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:41:58,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:41:58,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:41:58,318 INFO L272 TraceCheckUtils]: 84: Hoare triple {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,318 INFO L290 TraceCheckUtils]: 87: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,319 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14612#true} {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} #40#return; {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:41:58,319 INFO L290 TraceCheckUtils]: 89: Hoare triple {14870#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,320 INFO L290 TraceCheckUtils]: 90: Hoare triple {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,320 INFO L290 TraceCheckUtils]: 91: Hoare triple {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,320 INFO L272 TraceCheckUtils]: 92: Hoare triple {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,320 INFO L290 TraceCheckUtils]: 93: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,320 INFO L290 TraceCheckUtils]: 94: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,320 INFO L290 TraceCheckUtils]: 95: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,321 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14612#true} {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,321 INFO L290 TraceCheckUtils]: 97: Hoare triple {14895#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,322 INFO L290 TraceCheckUtils]: 98: Hoare triple {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,322 INFO L290 TraceCheckUtils]: 99: Hoare triple {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,322 INFO L272 TraceCheckUtils]: 100: Hoare triple {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,322 INFO L290 TraceCheckUtils]: 101: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,322 INFO L290 TraceCheckUtils]: 102: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,322 INFO L290 TraceCheckUtils]: 103: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,323 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {14612#true} {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:58,323 INFO L290 TraceCheckUtils]: 105: Hoare triple {14920#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:58,324 INFO L290 TraceCheckUtils]: 106: Hoare triple {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:58,324 INFO L290 TraceCheckUtils]: 107: Hoare triple {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:58,324 INFO L272 TraceCheckUtils]: 108: Hoare triple {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,324 INFO L290 TraceCheckUtils]: 109: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,324 INFO L290 TraceCheckUtils]: 110: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,324 INFO L290 TraceCheckUtils]: 111: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,325 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {14612#true} {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} #40#return; {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:41:58,325 INFO L290 TraceCheckUtils]: 113: Hoare triple {14945#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,326 INFO L290 TraceCheckUtils]: 114: Hoare triple {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,326 INFO L290 TraceCheckUtils]: 115: Hoare triple {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,326 INFO L272 TraceCheckUtils]: 116: Hoare triple {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,326 INFO L290 TraceCheckUtils]: 117: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,326 INFO L290 TraceCheckUtils]: 118: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,326 INFO L290 TraceCheckUtils]: 119: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,327 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {14612#true} {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} #40#return; {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,327 INFO L290 TraceCheckUtils]: 121: Hoare triple {14970#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:41:58,328 INFO L290 TraceCheckUtils]: 122: Hoare triple {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:41:58,328 INFO L290 TraceCheckUtils]: 123: Hoare triple {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:41:58,328 INFO L272 TraceCheckUtils]: 124: Hoare triple {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {14612#true} is VALID [2022-02-20 17:41:58,328 INFO L290 TraceCheckUtils]: 125: Hoare triple {14612#true} ~cond := #in~cond; {14612#true} is VALID [2022-02-20 17:41:58,328 INFO L290 TraceCheckUtils]: 126: Hoare triple {14612#true} assume !(0 == ~cond); {14612#true} is VALID [2022-02-20 17:41:58,328 INFO L290 TraceCheckUtils]: 127: Hoare triple {14612#true} assume true; {14612#true} is VALID [2022-02-20 17:41:58,329 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {14612#true} {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} #40#return; {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:41:58,330 INFO L290 TraceCheckUtils]: 129: Hoare triple {14995#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} assume !(main_~c~0#1 < main_~k~0#1); {15020#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:41:58,331 INFO L272 TraceCheckUtils]: 130: Hoare triple {15020#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15024#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:58,331 INFO L290 TraceCheckUtils]: 131: Hoare triple {15024#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15028#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:58,331 INFO L290 TraceCheckUtils]: 132: Hoare triple {15028#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14613#false} is VALID [2022-02-20 17:41:58,331 INFO L290 TraceCheckUtils]: 133: Hoare triple {14613#false} assume !false; {14613#false} is VALID [2022-02-20 17:41:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 32 proven. 480 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-02-20 17:41:58,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:58,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:58,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386873726] [2022-02-20 17:41:58,733 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:58,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054677776] [2022-02-20 17:41:58,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054677776] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:58,733 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:58,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-02-20 17:41:58,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611272629] [2022-02-20 17:41:58,733 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:58,734 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 134 [2022-02-20 17:41:58,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:58,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:41:58,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:58,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 17:41:58,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:58,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 17:41:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:41:58,814 INFO L87 Difference]: Start difference. First operand 169 states and 174 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:01,097 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2022-02-20 17:42:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 17:42:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 134 [2022-02-20 17:42:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 100 transitions. [2022-02-20 17:42:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 100 transitions. [2022-02-20 17:42:01,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 100 transitions. [2022-02-20 17:42:01,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:01,230 INFO L225 Difference]: With dead ends: 174 [2022-02-20 17:42:01,231 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 17:42:01,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-02-20 17:42:01,231 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:01,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1138 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 17:42:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 17:42:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 17:42:01,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:01,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:01,339 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:01,340 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:01,342 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2022-02-20 17:42:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-02-20 17:42:01,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:01,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:01,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:42:01,343 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:42:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:01,346 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2022-02-20 17:42:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-02-20 17:42:01,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:01,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:01,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:01,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2022-02-20 17:42:01,352 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 134 [2022-02-20 17:42:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:01,353 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2022-02-20 17:42:01,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-02-20 17:42:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-02-20 17:42:01,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:01,354 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:01,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-20 17:42:01,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-20 17:42:01,564 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1347219516, now seen corresponding path program 16 times [2022-02-20 17:42:01,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:01,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299048367] [2022-02-20 17:42:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:01,583 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:01,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1523460709] [2022-02-20 17:42:01,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:42:01,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:01,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:01,585 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:42:01,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-20 17:42:02,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:42:02,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:02,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-20 17:42:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:02,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:03,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {15892#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15892#true} is VALID [2022-02-20 17:42:03,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {15892#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:03,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:03,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:03,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,690 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15892#true} {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:03,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {15900#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:03,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:03,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:03,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,692 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15892#true} {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:03,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {15925#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:03,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:03,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:03,693 INFO L272 TraceCheckUtils]: 20: Hoare triple {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,694 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {15892#true} {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:03,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {15950#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:42:03,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:42:03,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:42:03,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,696 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15892#true} {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #40#return; {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:42:03,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {15975#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:03,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:03,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:03,697 INFO L272 TraceCheckUtils]: 36: Hoare triple {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,698 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15892#true} {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:03,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {16000#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,699 INFO L272 TraceCheckUtils]: 44: Hoare triple {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,700 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15892#true} {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {16025#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,701 INFO L272 TraceCheckUtils]: 52: Hoare triple {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,702 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {15892#true} {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {16050#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,703 INFO L272 TraceCheckUtils]: 60: Hoare triple {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,704 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15892#true} {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:03,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {16075#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:03,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:03,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:03,705 INFO L272 TraceCheckUtils]: 68: Hoare triple {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,705 INFO L290 TraceCheckUtils]: 70: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,706 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15892#true} {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} #40#return; {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:03,706 INFO L290 TraceCheckUtils]: 73: Hoare triple {16100#(and (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:42:03,706 INFO L290 TraceCheckUtils]: 74: Hoare triple {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:42:03,707 INFO L290 TraceCheckUtils]: 75: Hoare triple {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:42:03,707 INFO L272 TraceCheckUtils]: 76: Hoare triple {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,707 INFO L290 TraceCheckUtils]: 77: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,707 INFO L290 TraceCheckUtils]: 78: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,707 INFO L290 TraceCheckUtils]: 79: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,708 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15892#true} {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} #40#return; {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} is VALID [2022-02-20 17:42:03,708 INFO L290 TraceCheckUtils]: 81: Hoare triple {16125#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 4))))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:42:03,708 INFO L290 TraceCheckUtils]: 82: Hoare triple {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:42:03,709 INFO L290 TraceCheckUtils]: 83: Hoare triple {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:42:03,709 INFO L272 TraceCheckUtils]: 84: Hoare triple {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,709 INFO L290 TraceCheckUtils]: 85: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,709 INFO L290 TraceCheckUtils]: 86: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,709 INFO L290 TraceCheckUtils]: 87: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,710 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15892#true} {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} #40#return; {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} is VALID [2022-02-20 17:42:03,710 INFO L290 TraceCheckUtils]: 89: Hoare triple {16150#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= 5 (+ |ULTIMATE.start_main_~y~0#1| (- 5))))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:03,710 INFO L290 TraceCheckUtils]: 90: Hoare triple {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:03,711 INFO L290 TraceCheckUtils]: 91: Hoare triple {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:03,711 INFO L272 TraceCheckUtils]: 92: Hoare triple {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,711 INFO L290 TraceCheckUtils]: 93: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,711 INFO L290 TraceCheckUtils]: 94: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,711 INFO L290 TraceCheckUtils]: 95: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,712 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15892#true} {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} #40#return; {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:03,712 INFO L290 TraceCheckUtils]: 97: Hoare triple {16175#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} is VALID [2022-02-20 17:42:03,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} is VALID [2022-02-20 17:42:03,713 INFO L290 TraceCheckUtils]: 99: Hoare triple {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} is VALID [2022-02-20 17:42:03,713 INFO L272 TraceCheckUtils]: 100: Hoare triple {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,713 INFO L290 TraceCheckUtils]: 101: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,713 INFO L290 TraceCheckUtils]: 102: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,713 INFO L290 TraceCheckUtils]: 103: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,714 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {15892#true} {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} #40#return; {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} is VALID [2022-02-20 17:42:03,714 INFO L290 TraceCheckUtils]: 105: Hoare triple {16200#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:03,714 INFO L290 TraceCheckUtils]: 106: Hoare triple {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:03,715 INFO L290 TraceCheckUtils]: 107: Hoare triple {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:03,715 INFO L272 TraceCheckUtils]: 108: Hoare triple {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,715 INFO L290 TraceCheckUtils]: 109: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,715 INFO L290 TraceCheckUtils]: 110: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,715 INFO L290 TraceCheckUtils]: 111: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,715 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {15892#true} {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} #40#return; {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:03,716 INFO L290 TraceCheckUtils]: 113: Hoare triple {16225#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} is VALID [2022-02-20 17:42:03,716 INFO L290 TraceCheckUtils]: 114: Hoare triple {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} is VALID [2022-02-20 17:42:03,717 INFO L290 TraceCheckUtils]: 115: Hoare triple {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} is VALID [2022-02-20 17:42:03,717 INFO L272 TraceCheckUtils]: 116: Hoare triple {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,717 INFO L290 TraceCheckUtils]: 117: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,717 INFO L290 TraceCheckUtils]: 118: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,717 INFO L290 TraceCheckUtils]: 119: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,717 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {15892#true} {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} #40#return; {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} is VALID [2022-02-20 17:42:03,718 INFO L290 TraceCheckUtils]: 121: Hoare triple {16250#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:03,718 INFO L290 TraceCheckUtils]: 122: Hoare triple {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:03,719 INFO L290 TraceCheckUtils]: 123: Hoare triple {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:03,719 INFO L272 TraceCheckUtils]: 124: Hoare triple {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,719 INFO L290 TraceCheckUtils]: 125: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,719 INFO L290 TraceCheckUtils]: 126: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,719 INFO L290 TraceCheckUtils]: 127: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,719 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {15892#true} {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} #40#return; {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:03,720 INFO L290 TraceCheckUtils]: 129: Hoare triple {16275#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 13) (= |ULTIMATE.start_main_~c~0#1| 15))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} is VALID [2022-02-20 17:42:03,720 INFO L290 TraceCheckUtils]: 130: Hoare triple {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} is VALID [2022-02-20 17:42:03,721 INFO L290 TraceCheckUtils]: 131: Hoare triple {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} is VALID [2022-02-20 17:42:03,721 INFO L272 TraceCheckUtils]: 132: Hoare triple {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {15892#true} is VALID [2022-02-20 17:42:03,721 INFO L290 TraceCheckUtils]: 133: Hoare triple {15892#true} ~cond := #in~cond; {15892#true} is VALID [2022-02-20 17:42:03,721 INFO L290 TraceCheckUtils]: 134: Hoare triple {15892#true} assume !(0 == ~cond); {15892#true} is VALID [2022-02-20 17:42:03,721 INFO L290 TraceCheckUtils]: 135: Hoare triple {15892#true} assume true; {15892#true} is VALID [2022-02-20 17:42:03,722 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {15892#true} {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} #40#return; {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} is VALID [2022-02-20 17:42:03,723 INFO L290 TraceCheckUtils]: 137: Hoare triple {16300#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} assume !(main_~c~0#1 < main_~k~0#1); {16325#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (<= |ULTIMATE.start_main_~k~0#1| 16) (< 15 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:03,723 INFO L272 TraceCheckUtils]: 138: Hoare triple {16325#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 13) (<= |ULTIMATE.start_main_~k~0#1| 16) (< 15 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {16329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:03,724 INFO L290 TraceCheckUtils]: 139: Hoare triple {16329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:03,724 INFO L290 TraceCheckUtils]: 140: Hoare triple {16333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15893#false} is VALID [2022-02-20 17:42:03,724 INFO L290 TraceCheckUtils]: 141: Hoare triple {15893#false} assume !false; {15893#false} is VALID [2022-02-20 17:42:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 34 proven. 544 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-02-20 17:42:03,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:04,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:04,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299048367] [2022-02-20 17:42:04,213 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:04,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523460709] [2022-02-20 17:42:04,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523460709] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:04,213 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:04,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-02-20 17:42:04,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222483593] [2022-02-20 17:42:04,214 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:04,214 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 142 [2022-02-20 17:42:04,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:04,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:04,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:04,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 17:42:04,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:04,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 17:42:04,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-02-20 17:42:04,334 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:07,131 INFO L93 Difference]: Finished difference Result 174 states and 177 transitions. [2022-02-20 17:42:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 17:42:07,131 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 142 [2022-02-20 17:42:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-02-20 17:42:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-02-20 17:42:07,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2022-02-20 17:42:07,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:07,298 INFO L225 Difference]: With dead ends: 174 [2022-02-20 17:42:07,298 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 17:42:07,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-02-20 17:42:07,299 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:07,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1258 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 17:42:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 17:42:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 17:42:07,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:07,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:07,406 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:07,406 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:07,409 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2022-02-20 17:42:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2022-02-20 17:42:07,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:07,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:07,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:42:07,410 INFO L87 Difference]: Start difference. First operand has 169 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 169 states. [2022-02-20 17:42:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:07,413 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2022-02-20 17:42:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2022-02-20 17:42:07,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:07,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:07,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:07,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 17:42:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2022-02-20 17:42:07,417 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 142 [2022-02-20 17:42:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:07,417 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2022-02-20 17:42:07,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2022-02-20 17:42:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-02-20 17:42:07,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:07,418 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:07,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-02-20 17:42:07,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:07,619 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:07,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash 764197026, now seen corresponding path program 17 times [2022-02-20 17:42:07,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:07,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639196684] [2022-02-20 17:42:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:07,639 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:07,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384743506] [2022-02-20 17:42:07,639 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:42:07,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:07,641 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:42:07,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-20 17:42:08,391 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-02-20 17:42:08,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:08,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 76 conjunts are in the unsatisfiable core [2022-02-20 17:42:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:08,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:09,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {17197#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17197#true} is VALID [2022-02-20 17:42:09,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {17197#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:09,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:09,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:09,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,315 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {17197#true} {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:09,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {17205#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:09,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:09,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:09,317 INFO L272 TraceCheckUtils]: 12: Hoare triple {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,317 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17197#true} {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:09,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {17230#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,319 INFO L272 TraceCheckUtils]: 20: Hoare triple {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,319 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17197#true} {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {17255#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:09,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:09,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:09,321 INFO L272 TraceCheckUtils]: 28: Hoare triple {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,321 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17197#true} {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:09,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {17280#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:09,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:09,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:09,322 INFO L272 TraceCheckUtils]: 36: Hoare triple {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,323 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17197#true} {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:09,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {17305#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,324 INFO L272 TraceCheckUtils]: 44: Hoare triple {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,325 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {17197#true} {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #40#return; {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {17330#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,326 INFO L272 TraceCheckUtils]: 52: Hoare triple {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,327 INFO L290 TraceCheckUtils]: 54: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,327 INFO L290 TraceCheckUtils]: 55: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,327 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {17197#true} {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} #40#return; {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {17355#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,328 INFO L272 TraceCheckUtils]: 60: Hoare triple {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,329 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17197#true} {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} #40#return; {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {17380#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 7 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:09,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:09,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:09,330 INFO L272 TraceCheckUtils]: 68: Hoare triple {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,331 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {17197#true} {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} #40#return; {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:09,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {17405#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:42:09,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:42:09,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:42:09,332 INFO L272 TraceCheckUtils]: 76: Hoare triple {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,333 INFO L290 TraceCheckUtils]: 77: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,333 INFO L290 TraceCheckUtils]: 78: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,333 INFO L290 TraceCheckUtils]: 79: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,333 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {17197#true} {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} #40#return; {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:42:09,334 INFO L290 TraceCheckUtils]: 81: Hoare triple {17430#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 8) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:42:09,334 INFO L290 TraceCheckUtils]: 82: Hoare triple {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:42:09,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:42:09,335 INFO L272 TraceCheckUtils]: 84: Hoare triple {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,335 INFO L290 TraceCheckUtils]: 85: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,335 INFO L290 TraceCheckUtils]: 86: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,335 INFO L290 TraceCheckUtils]: 87: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,335 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17197#true} {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} #40#return; {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} is VALID [2022-02-20 17:42:09,336 INFO L290 TraceCheckUtils]: 89: Hoare triple {17455#(and (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:42:09,336 INFO L290 TraceCheckUtils]: 90: Hoare triple {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:42:09,336 INFO L290 TraceCheckUtils]: 91: Hoare triple {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:42:09,337 INFO L272 TraceCheckUtils]: 92: Hoare triple {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,337 INFO L290 TraceCheckUtils]: 93: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,337 INFO L290 TraceCheckUtils]: 94: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,337 INFO L290 TraceCheckUtils]: 95: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,337 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17197#true} {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} #40#return; {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:42:09,338 INFO L290 TraceCheckUtils]: 97: Hoare triple {17480#(and (= 8 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 11))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:09,338 INFO L290 TraceCheckUtils]: 98: Hoare triple {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:09,338 INFO L290 TraceCheckUtils]: 99: Hoare triple {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:09,338 INFO L272 TraceCheckUtils]: 100: Hoare triple {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,339 INFO L290 TraceCheckUtils]: 101: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,339 INFO L290 TraceCheckUtils]: 102: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,339 INFO L290 TraceCheckUtils]: 103: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,339 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {17197#true} {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} #40#return; {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:09,340 INFO L290 TraceCheckUtils]: 105: Hoare triple {17505#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:09,340 INFO L290 TraceCheckUtils]: 106: Hoare triple {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:09,340 INFO L290 TraceCheckUtils]: 107: Hoare triple {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:09,340 INFO L272 TraceCheckUtils]: 108: Hoare triple {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,340 INFO L290 TraceCheckUtils]: 109: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,341 INFO L290 TraceCheckUtils]: 111: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,341 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {17197#true} {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} #40#return; {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:09,341 INFO L290 TraceCheckUtils]: 113: Hoare triple {17530#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:09,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:09,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:09,342 INFO L272 TraceCheckUtils]: 116: Hoare triple {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,342 INFO L290 TraceCheckUtils]: 117: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,342 INFO L290 TraceCheckUtils]: 118: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,343 INFO L290 TraceCheckUtils]: 119: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,343 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {17197#true} {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} #40#return; {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:09,343 INFO L290 TraceCheckUtils]: 121: Hoare triple {17555#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 13) (= 14 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} is VALID [2022-02-20 17:42:09,344 INFO L290 TraceCheckUtils]: 122: Hoare triple {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} is VALID [2022-02-20 17:42:09,344 INFO L290 TraceCheckUtils]: 123: Hoare triple {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} is VALID [2022-02-20 17:42:09,344 INFO L272 TraceCheckUtils]: 124: Hoare triple {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,344 INFO L290 TraceCheckUtils]: 125: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,344 INFO L290 TraceCheckUtils]: 126: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,344 INFO L290 TraceCheckUtils]: 127: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,345 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {17197#true} {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} #40#return; {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} is VALID [2022-02-20 17:42:09,345 INFO L290 TraceCheckUtils]: 129: Hoare triple {17580#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 13) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 14))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} is VALID [2022-02-20 17:42:09,346 INFO L290 TraceCheckUtils]: 130: Hoare triple {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} is VALID [2022-02-20 17:42:09,346 INFO L290 TraceCheckUtils]: 131: Hoare triple {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} is VALID [2022-02-20 17:42:09,346 INFO L272 TraceCheckUtils]: 132: Hoare triple {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,346 INFO L290 TraceCheckUtils]: 133: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,346 INFO L290 TraceCheckUtils]: 134: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,346 INFO L290 TraceCheckUtils]: 135: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,347 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {17197#true} {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} #40#return; {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} is VALID [2022-02-20 17:42:09,347 INFO L290 TraceCheckUtils]: 137: Hoare triple {17605#(and (= 14 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} is VALID [2022-02-20 17:42:09,348 INFO L290 TraceCheckUtils]: 138: Hoare triple {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} is VALID [2022-02-20 17:42:09,348 INFO L290 TraceCheckUtils]: 139: Hoare triple {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} is VALID [2022-02-20 17:42:09,348 INFO L272 TraceCheckUtils]: 140: Hoare triple {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17197#true} is VALID [2022-02-20 17:42:09,348 INFO L290 TraceCheckUtils]: 141: Hoare triple {17197#true} ~cond := #in~cond; {17197#true} is VALID [2022-02-20 17:42:09,348 INFO L290 TraceCheckUtils]: 142: Hoare triple {17197#true} assume !(0 == ~cond); {17197#true} is VALID [2022-02-20 17:42:09,348 INFO L290 TraceCheckUtils]: 143: Hoare triple {17197#true} assume true; {17197#true} is VALID [2022-02-20 17:42:09,349 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17197#true} {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} #40#return; {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} is VALID [2022-02-20 17:42:09,349 INFO L290 TraceCheckUtils]: 145: Hoare triple {17630#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} assume !(main_~c~0#1 < main_~k~0#1); {17655#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 17) (= |ULTIMATE.start_main_~y~0#1| 17))} is VALID [2022-02-20 17:42:09,350 INFO L272 TraceCheckUtils]: 146: Hoare triple {17655#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 17) (= |ULTIMATE.start_main_~y~0#1| 17))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {17659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:09,350 INFO L290 TraceCheckUtils]: 147: Hoare triple {17659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:09,351 INFO L290 TraceCheckUtils]: 148: Hoare triple {17663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17198#false} is VALID [2022-02-20 17:42:09,351 INFO L290 TraceCheckUtils]: 149: Hoare triple {17198#false} assume !false; {17198#false} is VALID [2022-02-20 17:42:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 36 proven. 612 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-02-20 17:42:09,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:09,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:09,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639196684] [2022-02-20 17:42:09,663 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:09,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384743506] [2022-02-20 17:42:09,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384743506] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:09,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:09,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-02-20 17:42:09,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484025384] [2022-02-20 17:42:09,664 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 150 [2022-02-20 17:42:09,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:09,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:42:09,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:09,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 17:42:09,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 17:42:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-02-20 17:42:09,774 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)