./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-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/ps6-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 946e199240c0e980bd422384e40e4d2247ef6b3560471b18ba5a354c3628dba9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:43:08,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:43:08,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:43:08,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:43:08,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:43:08,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:43:08,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:43:08,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:43:08,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:43:08,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:43:08,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:43:08,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:43:08,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:43:08,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:43:08,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:43:08,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:43:08,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:43:08,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:43:08,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:43:08,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:43:08,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:43:08,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:43:08,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:43:08,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:43:08,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:43:08,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:43:08,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:43:08,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:43:08,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:43:08,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:43:08,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:43:08,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:43:08,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:43:08,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:43:08,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:43:08,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:43:08,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:43:08,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:43:08,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:43:08,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:43:08,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:43:08,946 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:43:08,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:43:08,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:43:08,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:43:08,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:43:08,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:43:08,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:43:08,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:43:08,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:43:08,978 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:43:08,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:43:08,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:43:08,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:43:08,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:43:08,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:43:08,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:43:08,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:43:08,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:43:08,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:43:08,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:43:08,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:43:08,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:43:08,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:43:08,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:43:08,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:43:08,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:08,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:43:08,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:43:08,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:43:08,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:43:08,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:43:08,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:43:08,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:43:08,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:43:08,983 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 -> 946e199240c0e980bd422384e40e4d2247ef6b3560471b18ba5a354c3628dba9 [2022-02-20 17:43:09,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:43:09,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:43:09,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:43:09,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:43:09,264 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:43:09,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-02-20 17:43:09,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a6d6acd/34ae30f377384a148ae5c31dfc3062ed/FLAG3a18d6e9c [2022-02-20 17:43:09,727 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:43:09,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-02-20 17:43:09,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a6d6acd/34ae30f377384a148ae5c31dfc3062ed/FLAG3a18d6e9c [2022-02-20 17:43:10,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a6d6acd/34ae30f377384a148ae5c31dfc3062ed [2022-02-20 17:43:10,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:43:10,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:43:10,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:10,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:43:10,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:43:10,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502d8d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10, skipping insertion in model container [2022-02-20 17:43:10,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:43:10,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:43:10,296 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/ps6-ll_unwindbound20.c[458,471] [2022-02-20 17:43:10,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:10,339 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:43:10,347 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/ps6-ll_unwindbound20.c[458,471] [2022-02-20 17:43:10,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:10,366 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:43:10,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10 WrapperNode [2022-02-20 17:43:10,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:10,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:10,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:43:10,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:43:10,374 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:43:10" (1/1) ... [2022-02-20 17:43:10,380 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:43:10" (1/1) ... [2022-02-20 17:43:10,398 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-02-20 17:43:10,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:10,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:43:10,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:43:10,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:43:10,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:43:10,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:43:10,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:43:10,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:43:10,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (1/1) ... [2022-02-20 17:43:10,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:10,454 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:43:10,463 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:43:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:43:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:43:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:43:10,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:43:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:43:10,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:43:10,533 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:43:10,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:43:10,666 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:43:10,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:43:10,673 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:43:10,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:10 BoogieIcfgContainer [2022-02-20 17:43:10,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:43:10,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:43:10,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:43:10,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:43:10,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:43:10" (1/3) ... [2022-02-20 17:43:10,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73deb5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:10, skipping insertion in model container [2022-02-20 17:43:10,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:10" (2/3) ... [2022-02-20 17:43:10,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73deb5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:10, skipping insertion in model container [2022-02-20 17:43:10,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:10" (3/3) ... [2022-02-20 17:43:10,683 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2022-02-20 17:43:10,688 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:43:10,688 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:43:10,751 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:43:10,773 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:43:10,773 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:43:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:43:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:43:10,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:10,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:10,794 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -579246775, now seen corresponding path program 1 times [2022-02-20 17:43:10,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:10,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316390754] [2022-02-20 17:43:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:10,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:10,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#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; {23#true} is VALID [2022-02-20 17:43:10,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23#true} is VALID [2022-02-20 17:43:10,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {24#false} is VALID [2022-02-20 17:43:10,971 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {24#false} is VALID [2022-02-20 17:43:10,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 17:43:10,972 INFO L272 TraceCheckUtils]: 5: Hoare triple {24#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {24#false} is VALID [2022-02-20 17:43:10,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-02-20 17:43:10,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-02-20 17:43:10,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 17:43:10,973 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:43:10,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:10,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316390754] [2022-02-20 17:43:10,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316390754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:10,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:10,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:43:10,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855410355] [2022-02-20 17:43:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:43:10,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:10,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:11,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:11,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:43:11,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:43:11,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:11,037 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:11,266 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-02-20 17:43:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:43:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:43:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:43:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:43:11,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2022-02-20 17:43:11,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:11,368 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:43:11,369 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:43:11,372 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:43:11,376 INFO L933 BasicCegarLoop]: 23 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, 23 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:43:11,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:43:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:43:11,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:11,400 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:43:11,401 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:43:11,401 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:43:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:11,404 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:43:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:43:11,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:11,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:11,406 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:43:11,406 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:43:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:11,408 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:43:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:43:11,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:11,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:11,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:11,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:11,410 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:43:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 17:43:11,413 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2022-02-20 17:43:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:11,413 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 17:43:11,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:43:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:43:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:43:11,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:11,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:11,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:43:11,415 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1986551203, now seen corresponding path program 1 times [2022-02-20 17:43:11,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:11,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407884200] [2022-02-20 17:43:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:11,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#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; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:11,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(= ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:11,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:11,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:43:11,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:43:11,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {130#false} is VALID [2022-02-20 17:43:11,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {130#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {130#false} is VALID [2022-02-20 17:43:11,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} ~cond := #in~cond; {130#false} is VALID [2022-02-20 17:43:11,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#false} assume 0 == ~cond; {130#false} is VALID [2022-02-20 17:43:11,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-02-20 17:43:11,494 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:43:11,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:11,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407884200] [2022-02-20 17:43:11,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407884200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:11,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:11,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:43:11,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092555796] [2022-02-20 17:43:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:43:11,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:11,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43:11,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:11,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:43:11,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:43:11,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:43:11,513 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:23,591 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:43:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:43:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:43:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:43:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:43:23,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-02-20 17:43:23,626 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:43:23,627 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:43:23,627 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:43:23,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:43:23,629 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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:43:23,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:43:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 17:43:23,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:23,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:43:23,634 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:43:23,634 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:43:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:23,636 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:43:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:43:23,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:23,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:23,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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 18 states. [2022-02-20 17:43:23,637 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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 18 states. [2022-02-20 17:43:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:23,639 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:43:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:43:23,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:23,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:23,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:23,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:43:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 17:43:23,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2022-02-20 17:43:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:23,643 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 17:43:23,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:43:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:43:23,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:23,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:23,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:43:23,644 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1984763743, now seen corresponding path program 1 times [2022-02-20 17:43:23,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:23,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711353900] [2022-02-20 17:43:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:23,660 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:23,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651367534] [2022-02-20 17:43:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:23,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:23,663 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:43:23,688 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:43:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:23,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:43:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:23,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:23,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#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; {230#true} is VALID [2022-02-20 17:43:23,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {230#true} is VALID [2022-02-20 17:43:23,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume !(0 == assume_abort_if_not_~cond#1); {230#true} is VALID [2022-02-20 17:43:23,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {230#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:23,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#(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; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:23,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#(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; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:23,888 INFO L272 TraceCheckUtils]: 6: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:23,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:23,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {231#false} is VALID [2022-02-20 17:43:23,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 17:43:23,890 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:43:23,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:43:23,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:23,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711353900] [2022-02-20 17:43:23,891 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:23,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651367534] [2022-02-20 17:43:23,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651367534] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:23,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:23,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:43:23,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136241175] [2022-02-20 17:43:23,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:23,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:43:23,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:23,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:43:23,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:23,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:23,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:43:23,923 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:43:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:24,064 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:43:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:43:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:43:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:43:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:43:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:43:24,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-20 17:43:24,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:24,123 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:43:24,123 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:43:24,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:43:24,128 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:24,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:43:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:43:24,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:24,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:43:24,136 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:43:24,136 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:43:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:24,138 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:43:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:43:24,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:24,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:24,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 24 states. [2022-02-20 17:43:24,139 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 24 states. [2022-02-20 17:43:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:24,141 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:43:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:43:24,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:24,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:24,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:24,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:43:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:43:24,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:43:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:24,147 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:43:24,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:43:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:43:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:24,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:24,149 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:24,178 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:43:24,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:24,374 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -69803837, now seen corresponding path program 1 times [2022-02-20 17:43:24,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:24,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531050372] [2022-02-20 17:43:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:24,403 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:24,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33789746] [2022-02-20 17:43:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:24,408 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:43:24,409 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:43:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:24,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:43:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:24,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:24,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#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; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:24,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(<= ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:24,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:24,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {389#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:24,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {389#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {402#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(<= ~counter~0 1)} ~cond := #in~cond; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {402#(<= ~counter~0 1)} assume !(0 == ~cond); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#(<= ~counter~0 1)} assume true; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {402#(<= ~counter~0 1)} {402#(<= ~counter~0 1)} #47#return; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {402#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:24,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {402#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:43:24,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:43:24,631 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:43:24,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:43:24,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:43:24,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:43:24,632 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:43:24,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:24,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:43:24,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:43:24,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:43:24,810 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:43:24,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(< |ULTIMATE.start_main_#t~post5#1| 20)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:43:24,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(< ~counter~0 20)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {455#(< |ULTIMATE.start_main_#t~post5#1| 20)} is VALID [2022-02-20 17:43:24,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:43:24,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {384#true} {459#(< ~counter~0 20)} #47#return; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:43:24,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#true} assume true; {384#true} is VALID [2022-02-20 17:43:24,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#true} assume !(0 == ~cond); {384#true} is VALID [2022-02-20 17:43:24,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#true} ~cond := #in~cond; {384#true} is VALID [2022-02-20 17:43:24,816 INFO L272 TraceCheckUtils]: 6: Hoare triple {459#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {384#true} is VALID [2022-02-20 17:43:24,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {459#(< ~counter~0 20)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:43:24,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(< ~counter~0 19)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:43:24,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(< ~counter~0 19)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {484#(< ~counter~0 19)} is VALID [2022-02-20 17:43:24,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(< ~counter~0 19)} assume !(0 == assume_abort_if_not_~cond#1); {484#(< ~counter~0 19)} is VALID [2022-02-20 17:43:24,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(< ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {484#(< ~counter~0 19)} is VALID [2022-02-20 17:43:24,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#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; {484#(< ~counter~0 19)} is VALID [2022-02-20 17:43:24,822 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:43:24,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:24,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531050372] [2022-02-20 17:43:24,825 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:24,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33789746] [2022-02-20 17:43:24,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33789746] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:43:24,828 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:43:24,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:43:24,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899419399] [2022-02-20 17:43:24,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:24,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 18 [2022-02-20 17:43:24,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:24,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:43:24,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:24,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:43:24,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:43:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:43:24,872 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:43:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:25,118 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-02-20 17:43:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:43:25,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 18 [2022-02-20 17:43:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:43:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:43:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:43:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:43:25,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2022-02-20 17:43:25,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:25,190 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:43:25,191 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:43:25,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 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:43:25,192 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:25,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 82 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:43:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-02-20 17:43:25,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:25,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 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:43:25,207 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 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:43:25,207 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 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:43:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:25,210 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:43:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:43:25,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:25,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:25,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 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 50 states. [2022-02-20 17:43:25,212 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 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 50 states. [2022-02-20 17:43:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:25,215 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:43:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:43:25,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:25,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:25,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:25,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 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:43:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-02-20 17:43:25,220 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 18 [2022-02-20 17:43:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:25,220 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-02-20 17:43:25,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:43:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-02-20 17:43:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:25,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:25,221 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:25,243 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:43:25,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:43:25,440 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:25,440 INFO L85 PathProgramCache]: Analyzing trace with hash -68016377, now seen corresponding path program 1 times [2022-02-20 17:43:25,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:25,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195044604] [2022-02-20 17:43:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:25,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:25,456 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:25,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598768240] [2022-02-20 17:43:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:25,458 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:43:25,463 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:43:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:25,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:43:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:25,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:25,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#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; {747#true} is VALID [2022-02-20 17:43:25,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:43:25,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:43:25,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:25,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {761#(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; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:25,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#(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; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:25,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:43:25,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:43:25,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:43:25,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:43:25,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #47#return; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:25,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {761#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0))} is VALID [2022-02-20 17:43:25,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0))} is VALID [2022-02-20 17:43:25,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0))} is VALID [2022-02-20 17:43:25,697 INFO L272 TraceCheckUtils]: 14: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 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|)) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:25,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:25,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:43:25,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:43:25,698 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:43:25,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:25,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:43:25,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:43:25,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:25,855 INFO L272 TraceCheckUtils]: 14: Hoare triple {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:25,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:25,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:25,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:25,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} #47#return; {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:25,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:43:25,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:43:25,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:43:25,951 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:43:25,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:25,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:25,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {816#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:25,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:43:25,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:43:25,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#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; {747#true} is VALID [2022-02-20 17:43:25,954 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:43:25,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:25,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195044604] [2022-02-20 17:43:25,954 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:25,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598768240] [2022-02-20 17:43:25,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598768240] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:25,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:25,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:43:25,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793463850] [2022-02-20 17:43:25,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 18 [2022-02-20 17:43:25,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:25,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:43:26,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:26,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:26,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:26,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:43:26,312 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:43:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:26,439 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-02-20 17:43:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:26,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 18 [2022-02-20 17:43:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:43:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:43:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:43:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:43:26,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-02-20 17:43:26,616 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:43:26,617 INFO L225 Difference]: With dead ends: 60 [2022-02-20 17:43:26,618 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:43:26,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:43:26,619 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:26,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:43:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-02-20 17:43:26,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:26,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:26,648 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:26,649 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:26,654 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:43:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:43:26,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:26,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:26,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:43:26,658 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:43:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:26,663 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:43:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:43:26,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:26,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:26,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:26,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:43:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-02-20 17:43:26,674 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 18 [2022-02-20 17:43:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:26,674 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-02-20 17:43:26,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:43:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-02-20 17:43:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:43:26,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:26,676 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:26,703 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:43:26,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:26,900 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 156635680, now seen corresponding path program 1 times [2022-02-20 17:43:26,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:26,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057434021] [2022-02-20 17:43:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:26,914 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:26,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018661854] [2022-02-20 17:43:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:26,916 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:43:26,918 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:43:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:26,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:43:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:26,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:27,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {1110#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; {1110#true} is VALID [2022-02-20 17:43:27,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1110#true} is VALID [2022-02-20 17:43:27,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume !(0 == assume_abort_if_not_~cond#1); {1110#true} is VALID [2022-02-20 17:43:27,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {1110#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:27,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {1124#(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; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:27,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {1124#(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; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:27,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:43:27,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:43:27,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:43:27,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:43:27,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1110#true} {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:27,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {1124#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1149#(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:43:27,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#(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; {1149#(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:43:27,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#(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; {1149#(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:43:27,321 INFO L272 TraceCheckUtils]: 14: Hoare triple {1149#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:43:27,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:43:27,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:43:27,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:43:27,323 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1110#true} {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #47#return; {1149#(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:43:27,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {1149#(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); {1174#(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:43:27,324 INFO L272 TraceCheckUtils]: 20: Hoare triple {1174#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:43:27,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:43:27,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:43:27,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:43:27,336 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1110#true} {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1174#(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:43:27,337 INFO L272 TraceCheckUtils]: 25: Hoare triple {1174#(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 main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:27,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:27,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {1197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1111#false} is VALID [2022-02-20 17:43:27,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-02-20 17:43:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:43:27,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:27,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:27,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057434021] [2022-02-20 17:43:27,684 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:27,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018661854] [2022-02-20 17:43:27,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018661854] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:27,684 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:27,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:43:27,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264853415] [2022-02-20 17:43:27,685 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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 29 [2022-02-20 17:43:27,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:27,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:43:27,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:27,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:43:27,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:43:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:43:27,725 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:43:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:27,942 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-02-20 17:43:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:43:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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 29 [2022-02-20 17:43:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:43:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:43:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:43:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:43:27,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-02-20 17:43:27,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:27,985 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:43:27,985 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:43:27,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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:43:27,986 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:27,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:43:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:43:28,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:28,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:28,008 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:28,008 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:28,010 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:43:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:43:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:28,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:28,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:43:28,012 INFO L87 Difference]: Start difference. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:43:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:28,014 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:43:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:43:28,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:28,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:28,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:28,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-02-20 17:43:28,017 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2022-02-20 17:43:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:28,017 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-02-20 17:43:28,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:43:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:43:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:43:28,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:28,018 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:28,043 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:43:28,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:28,239 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1793229318, now seen corresponding path program 2 times [2022-02-20 17:43:28,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:28,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069817807] [2022-02-20 17:43:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:28,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:28,253 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:28,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392473448] [2022-02-20 17:43:28,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:43:28,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:28,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:28,254 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:43:28,264 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:43:28,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:43:28,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:28,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:43:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:28,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:28,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#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; {1490#true} is VALID [2022-02-20 17:43:28,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1490#true} is VALID [2022-02-20 17:43:28,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume !(0 == assume_abort_if_not_~cond#1); {1490#true} is VALID [2022-02-20 17:43:28,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {1490#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:28,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {1504#(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; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:28,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#(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; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:28,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:43:28,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:43:28,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:43:28,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:43:28,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1490#true} {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:28,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:28,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(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; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:28,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(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; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:28,771 INFO L272 TraceCheckUtils]: 14: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:43:28,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:43:28,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:43:28,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:43:28,772 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1490#true} {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:28,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:43:28,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 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; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:43:28,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 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; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:43:28,774 INFO L272 TraceCheckUtils]: 22: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:43:28,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:43:28,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:43:28,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:43:28,775 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1490#true} {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #47#return; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:43:28,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:28,776 INFO L272 TraceCheckUtils]: 28: Hoare triple {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:43:28,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:43:28,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:43:28,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:43:28,777 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1490#true} {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:28,778 INFO L272 TraceCheckUtils]: 33: Hoare triple {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:28,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:28,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1491#false} is VALID [2022-02-20 17:43:28,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-02-20 17:43:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:43:28,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:29,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:29,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069817807] [2022-02-20 17:43:29,110 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:29,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392473448] [2022-02-20 17:43:29,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392473448] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:29,110 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:29,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:43:29,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322322838] [2022-02-20 17:43:29,110 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 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 37 [2022-02-20 17:43:29,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:29,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 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:43:29,139 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:43:29,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:43:29,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:29,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:43:29,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:43:29,140 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 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:43:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:29,433 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-20 17:43:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:43:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 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 37 [2022-02-20 17:43:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 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:43:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:43:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 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:43:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:43:29,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-20 17:43:29,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:29,476 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:43:29,476 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:43:29,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:43:29,477 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:29,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:43:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:43:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:43:29,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:29,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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:43:29,493 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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:43:29,493 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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:43:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:29,495 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:43:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:43:29,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:29,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:29,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 44 states. [2022-02-20 17:43:29,496 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 44 states. [2022-02-20 17:43:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:29,497 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:43:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:43:29,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:29,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:29,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:29,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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:43:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-02-20 17:43:29,500 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2022-02-20 17:43:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:29,500 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-02-20 17:43:29,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 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:43:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:43:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:43:29,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:29,501 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:29,509 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:43:29,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:29,707 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1183870932, now seen corresponding path program 3 times [2022-02-20 17:43:29,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:29,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224098059] [2022-02-20 17:43:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:29,733 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:29,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676434451] [2022-02-20 17:43:29,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:43:29,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:29,735 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:43:29,767 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:43:30,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:43:30,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:30,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:43:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:30,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:31,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {1889#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; {1889#true} is VALID [2022-02-20 17:43:31,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1889#true} is VALID [2022-02-20 17:43:31,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {1889#true} assume !(0 == assume_abort_if_not_~cond#1); {1889#true} is VALID [2022-02-20 17:43:31,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {1889#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:31,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {1903#(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; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:31,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1903#(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; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:31,364 INFO L272 TraceCheckUtils]: 6: Hoare triple {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:43:31,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:43:31,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:43:31,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:43:31,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1889#true} {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1903#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:31,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {1903#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:31,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {1928#(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; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:31,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1928#(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; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:31,369 INFO L272 TraceCheckUtils]: 14: Hoare triple {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:43:31,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:43:31,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:43:31,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:43:31,371 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1889#true} {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {1928#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:31,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {1928#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:31,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {1953#(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; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:31,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {1953#(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; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:31,379 INFO L272 TraceCheckUtils]: 22: Hoare triple {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:43:31,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:43:31,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:43:31,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:43:31,380 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1889#true} {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {1953#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:31,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {1953#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1978#(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:43:31,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {1978#(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; {1978#(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:43:31,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {1978#(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; {1978#(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:43:31,381 INFO L272 TraceCheckUtils]: 30: Hoare triple {1978#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:43:31,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:43:31,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:43:31,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:43:31,383 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1889#true} {1978#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} #47#return; {1978#(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:43:31,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {1978#(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); {2003#(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:43:31,387 INFO L272 TraceCheckUtils]: 36: Hoare triple {2003#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1889#true} is VALID [2022-02-20 17:43:31,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-02-20 17:43:31,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-02-20 17:43:31,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-02-20 17:43:31,388 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1889#true} {2003#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #49#return; {2003#(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:43:31,389 INFO L272 TraceCheckUtils]: 41: Hoare triple {2003#(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 main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:31,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {2022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:31,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {2026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1890#false} is VALID [2022-02-20 17:43:31,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2022-02-20 17:43:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:43:31,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:31,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:31,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224098059] [2022-02-20 17:43:31,719 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:31,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676434451] [2022-02-20 17:43:31,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676434451] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:31,719 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:31,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-02-20 17:43:31,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362351983] [2022-02-20 17:43:31,719 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 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 45 [2022-02-20 17:43:31,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:31,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 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:43:31,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:31,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:43:31,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:43:31,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:43:31,754 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 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:43:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:32,094 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-02-20 17:43:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:43:32,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 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 45 [2022-02-20 17:43:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 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:43:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 17:43:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 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:43:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 17:43:32,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2022-02-20 17:43:32,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:32,134 INFO L225 Difference]: With dead ends: 52 [2022-02-20 17:43:32,134 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:43:32,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 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:43:32,135 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:32,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:43:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:43:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:43:32,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:32,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:32,158 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:32,158 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:32,160 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-02-20 17:43:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-02-20 17:43:32,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:32,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:32,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 17:43:32,162 INFO L87 Difference]: Start difference. First operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-02-20 17:43:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:32,163 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-02-20 17:43:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-02-20 17:43:32,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:32,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:32,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:32,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-02-20 17:43:32,166 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-02-20 17:43:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:32,166 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-02-20 17:43:32,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 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:43:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-02-20 17:43:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 17:43:32,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:32,168 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:32,181 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:43:32,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:32,378 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1854611729, now seen corresponding path program 1 times [2022-02-20 17:43:32,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:32,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172554483] [2022-02-20 17:43:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:32,391 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:32,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493290042] [2022-02-20 17:43:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:32,393 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:43:32,403 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:43:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:32,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:43:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:32,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:32,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#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; {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:32,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {2328#(<= ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:32,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {2328#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:32,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {2328#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2328#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:32,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {2328#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {2341#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {2341#(<= ~counter~0 1)} ~cond := #in~cond; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {2341#(<= ~counter~0 1)} assume !(0 == ~cond); {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#(<= ~counter~0 1)} assume true; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2341#(<= ~counter~0 1)} {2341#(<= ~counter~0 1)} #47#return; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {2341#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2341#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:32,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {2341#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {2366#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,777 INFO L272 TraceCheckUtils]: 14: Hoare triple {2366#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {2366#(<= ~counter~0 2)} ~cond := #in~cond; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {2366#(<= ~counter~0 2)} assume !(0 == ~cond); {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {2366#(<= ~counter~0 2)} assume true; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,779 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2366#(<= ~counter~0 2)} {2366#(<= ~counter~0 2)} #47#return; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {2366#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2366#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:32,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {2366#(<= ~counter~0 2)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {2391#(<= ~counter~0 3)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,781 INFO L272 TraceCheckUtils]: 22: Hoare triple {2391#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {2391#(<= ~counter~0 3)} ~cond := #in~cond; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {2391#(<= ~counter~0 3)} assume !(0 == ~cond); {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {2391#(<= ~counter~0 3)} assume true; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,783 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2391#(<= ~counter~0 3)} {2391#(<= ~counter~0 3)} #47#return; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {2391#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2391#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:32,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {2391#(<= ~counter~0 3)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {2416#(<= ~counter~0 4)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,785 INFO L272 TraceCheckUtils]: 30: Hoare triple {2416#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {2416#(<= ~counter~0 4)} ~cond := #in~cond; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {2416#(<= ~counter~0 4)} assume !(0 == ~cond); {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {2416#(<= ~counter~0 4)} assume true; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,787 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2416#(<= ~counter~0 4)} {2416#(<= ~counter~0 4)} #47#return; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {2416#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2416#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:32,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {2416#(<= ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2441#(<= |ULTIMATE.start_main_#t~post5#1| 4)} is VALID [2022-02-20 17:43:32,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {2441#(<= |ULTIMATE.start_main_#t~post5#1| 4)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2324#false} is VALID [2022-02-20 17:43:32,794 INFO L272 TraceCheckUtils]: 38: Hoare triple {2324#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2324#false} is VALID [2022-02-20 17:43:32,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {2324#false} ~cond := #in~cond; {2324#false} is VALID [2022-02-20 17:43:32,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {2324#false} assume !(0 == ~cond); {2324#false} is VALID [2022-02-20 17:43:32,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {2324#false} assume true; {2324#false} is VALID [2022-02-20 17:43:32,803 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2324#false} {2324#false} #49#return; {2324#false} is VALID [2022-02-20 17:43:32,803 INFO L272 TraceCheckUtils]: 43: Hoare triple {2324#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2324#false} is VALID [2022-02-20 17:43:32,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {2324#false} ~cond := #in~cond; {2324#false} is VALID [2022-02-20 17:43:32,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {2324#false} assume 0 == ~cond; {2324#false} is VALID [2022-02-20 17:43:32,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {2324#false} assume !false; {2324#false} is VALID [2022-02-20 17:43:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:43:32,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:33,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {2324#false} assume !false; {2324#false} is VALID [2022-02-20 17:43:33,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {2324#false} assume 0 == ~cond; {2324#false} is VALID [2022-02-20 17:43:33,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {2324#false} ~cond := #in~cond; {2324#false} is VALID [2022-02-20 17:43:33,100 INFO L272 TraceCheckUtils]: 43: Hoare triple {2324#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2324#false} is VALID [2022-02-20 17:43:33,100 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2323#true} {2324#false} #49#return; {2324#false} is VALID [2022-02-20 17:43:33,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:43:33,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:43:33,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:43:33,101 INFO L272 TraceCheckUtils]: 38: Hoare triple {2324#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:43:33,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {2499#(< |ULTIMATE.start_main_#t~post5#1| 20)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2324#false} is VALID [2022-02-20 17:43:33,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {2503#(< ~counter~0 20)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2499#(< |ULTIMATE.start_main_#t~post5#1| 20)} is VALID [2022-02-20 17:43:33,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {2503#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2503#(< ~counter~0 20)} is VALID [2022-02-20 17:43:33,103 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2323#true} {2503#(< ~counter~0 20)} #47#return; {2503#(< ~counter~0 20)} is VALID [2022-02-20 17:43:33,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:43:33,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:43:33,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:43:33,103 INFO L272 TraceCheckUtils]: 30: Hoare triple {2503#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:43:33,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {2503#(< ~counter~0 20)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2503#(< ~counter~0 20)} is VALID [2022-02-20 17:43:33,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {2528#(< ~counter~0 19)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2503#(< ~counter~0 20)} is VALID [2022-02-20 17:43:33,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {2528#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2528#(< ~counter~0 19)} is VALID [2022-02-20 17:43:33,106 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2323#true} {2528#(< ~counter~0 19)} #47#return; {2528#(< ~counter~0 19)} is VALID [2022-02-20 17:43:33,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:43:33,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:43:33,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:43:33,106 INFO L272 TraceCheckUtils]: 22: Hoare triple {2528#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:43:33,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {2528#(< ~counter~0 19)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2528#(< ~counter~0 19)} is VALID [2022-02-20 17:43:33,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {2553#(< ~counter~0 18)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2528#(< ~counter~0 19)} is VALID [2022-02-20 17:43:33,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {2553#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2553#(< ~counter~0 18)} is VALID [2022-02-20 17:43:33,108 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2323#true} {2553#(< ~counter~0 18)} #47#return; {2553#(< ~counter~0 18)} is VALID [2022-02-20 17:43:33,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:43:33,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:43:33,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:43:33,109 INFO L272 TraceCheckUtils]: 14: Hoare triple {2553#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:43:33,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {2553#(< ~counter~0 18)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2553#(< ~counter~0 18)} is VALID [2022-02-20 17:43:33,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {2578#(< ~counter~0 17)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2553#(< ~counter~0 18)} is VALID [2022-02-20 17:43:33,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {2578#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2578#(< ~counter~0 17)} is VALID [2022-02-20 17:43:33,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2323#true} {2578#(< ~counter~0 17)} #47#return; {2578#(< ~counter~0 17)} is VALID [2022-02-20 17:43:33,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {2323#true} assume true; {2323#true} is VALID [2022-02-20 17:43:33,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {2323#true} assume !(0 == ~cond); {2323#true} is VALID [2022-02-20 17:43:33,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {2323#true} ~cond := #in~cond; {2323#true} is VALID [2022-02-20 17:43:33,112 INFO L272 TraceCheckUtils]: 6: Hoare triple {2578#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2323#true} is VALID [2022-02-20 17:43:33,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {2578#(< ~counter~0 17)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {2578#(< ~counter~0 17)} is VALID [2022-02-20 17:43:33,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {2603#(< ~counter~0 16)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2578#(< ~counter~0 17)} is VALID [2022-02-20 17:43:33,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {2603#(< ~counter~0 16)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2603#(< ~counter~0 16)} is VALID [2022-02-20 17:43:33,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {2603#(< ~counter~0 16)} assume !(0 == assume_abort_if_not_~cond#1); {2603#(< ~counter~0 16)} is VALID [2022-02-20 17:43:33,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {2603#(< ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2603#(< ~counter~0 16)} is VALID [2022-02-20 17:43:33,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#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; {2603#(< ~counter~0 16)} is VALID [2022-02-20 17:43:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:43:33,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:33,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172554483] [2022-02-20 17:43:33,116 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:33,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493290042] [2022-02-20 17:43:33,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493290042] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:43:33,116 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:43:33,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 17:43:33,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405896112] [2022-02-20 17:43:33,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 47 [2022-02-20 17:43:33,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:33,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:43:33,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:33,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:43:33,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:43:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:43:33,180 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:43:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:33,751 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-02-20 17:43:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 17:43:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 47 [2022-02-20 17:43:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:43:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2022-02-20 17:43:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:43:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2022-02-20 17:43:33,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 137 transitions. [2022-02-20 17:43:33,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:33,883 INFO L225 Difference]: With dead ends: 132 [2022-02-20 17:43:33,883 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 17:43:33,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 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:43:33,884 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:33,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 127 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:43:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 17:43:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2022-02-20 17:43:33,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:33,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:43:33,928 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:43:33,929 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:43:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:33,933 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-02-20 17:43:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-02-20 17:43:33,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:33,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:33,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 122 states. [2022-02-20 17:43:33,934 INFO L87 Difference]: Start difference. First operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 122 states. [2022-02-20 17:43:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:33,938 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-02-20 17:43:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-02-20 17:43:33,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:33,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:33,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:33,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:43:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2022-02-20 17:43:33,944 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 47 [2022-02-20 17:43:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:33,944 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2022-02-20 17:43:33,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:43:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2022-02-20 17:43:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 17:43:33,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:33,946 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:33,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 17:43:34,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:34,171 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:34,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash 348710830, now seen corresponding path program 4 times [2022-02-20 17:43:34,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:34,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075595587] [2022-02-20 17:43:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:34,188 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:34,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874319251] [2022-02-20 17:43:34,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:43:34,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:34,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:34,193 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:43:34,199 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:43:34,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:43:34,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:34,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:43:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:34,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:34,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {3198#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; {3198#true} is VALID [2022-02-20 17:43:34,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {3198#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3198#true} is VALID [2022-02-20 17:43:34,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {3198#true} assume !(0 == assume_abort_if_not_~cond#1); {3198#true} is VALID [2022-02-20 17:43:34,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {3198#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:34,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {3212#(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; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:34,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {3212#(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; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:34,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:43:34,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:43:34,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:43:34,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:43:34,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3198#true} {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {3212#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:34,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {3212#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:34,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {3237#(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; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:34,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {3237#(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; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:34,693 INFO L272 TraceCheckUtils]: 14: Hoare triple {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:43:34,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:43:34,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:43:34,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:43:34,694 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3198#true} {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {3237#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:34,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {3237#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:34,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {3262#(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; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:34,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {3262#(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; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:34,695 INFO L272 TraceCheckUtils]: 22: Hoare triple {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:43:34,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:43:34,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:43:34,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:43:34,696 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3198#true} {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #47#return; {3262#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:34,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {3262#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:34,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {3287#(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; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:34,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {3287#(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; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:34,698 INFO L272 TraceCheckUtils]: 30: Hoare triple {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:43:34,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:43:34,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:43:34,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:43:34,699 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3198#true} {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #47#return; {3287#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:34,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {3287#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:34,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:34,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:34,700 INFO L272 TraceCheckUtils]: 38: Hoare triple {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:43:34,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:43:34,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:43:34,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:43:34,701 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3198#true} {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #47#return; {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:34,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {3312#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3337#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:34,702 INFO L272 TraceCheckUtils]: 44: Hoare triple {3337#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3198#true} is VALID [2022-02-20 17:43:34,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {3198#true} ~cond := #in~cond; {3198#true} is VALID [2022-02-20 17:43:34,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {3198#true} assume !(0 == ~cond); {3198#true} is VALID [2022-02-20 17:43:34,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {3198#true} assume true; {3198#true} is VALID [2022-02-20 17:43:34,703 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3198#true} {3337#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #49#return; {3337#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:34,704 INFO L272 TraceCheckUtils]: 49: Hoare triple {3337#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3356#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:34,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {3356#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3360#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:34,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {3360#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3199#false} is VALID [2022-02-20 17:43:34,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {3199#false} assume !false; {3199#false} is VALID [2022-02-20 17:43:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:43:34,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:35,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:35,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075595587] [2022-02-20 17:43:35,044 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:35,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874319251] [2022-02-20 17:43:35,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874319251] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:35,045 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:35,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:43:35,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007825327] [2022-02-20 17:43:35,045 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:35,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 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 53 [2022-02-20 17:43:35,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:35,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 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:43:35,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:35,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:43:35,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:43:35,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:43:35,081 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 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:43:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:35,484 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-02-20 17:43:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:43:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 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 53 [2022-02-20 17:43:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 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:43:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 17:43:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 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:43:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 17:43:35,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-02-20 17:43:35,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:35,555 INFO L225 Difference]: With dead ends: 102 [2022-02-20 17:43:35,555 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 17:43:35,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 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:43:35,556 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:35,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 246 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:43:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 17:43:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-20 17:43:35,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:35,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:43:35,608 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:43:35,609 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:43:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:35,611 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 17:43:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 17:43:35,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:35,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:35,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) Second operand 96 states. [2022-02-20 17:43:35,613 INFO L87 Difference]: Start difference. First operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) Second operand 96 states. [2022-02-20 17:43:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:35,616 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 17:43:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 17:43:35,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:35,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:35,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:35,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:43:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-02-20 17:43:35,620 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 53 [2022-02-20 17:43:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:35,620 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-02-20 17:43:35,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 6 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:43:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 17:43:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 17:43:35,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:35,621 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:35,647 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:43:35,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:43:35,835 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1021371784, now seen corresponding path program 5 times [2022-02-20 17:43:35,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:35,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535843741] [2022-02-20 17:43:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:35,849 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:35,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435273818] [2022-02-20 17:43:35,849 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:43:35,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:35,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:35,851 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:43:35,863 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:43:36,365 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 17:43:36,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:36,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 17:43:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:36,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:36,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {3899#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; {3899#true} is VALID [2022-02-20 17:43:36,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {3899#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3899#true} is VALID [2022-02-20 17:43:36,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {3899#true} assume !(0 == assume_abort_if_not_~cond#1); {3899#true} is VALID [2022-02-20 17:43:36,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {3899#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:36,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {3913#(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; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:36,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {3913#(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; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:36,888 INFO L272 TraceCheckUtils]: 6: Hoare triple {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:43:36,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:43:36,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:43:36,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:43:36,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3899#true} {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {3913#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:36,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {3913#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:36,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {3938#(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; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:36,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {3938#(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; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:36,891 INFO L272 TraceCheckUtils]: 14: Hoare triple {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:43:36,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:43:36,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:43:36,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:43:36,896 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3899#true} {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {3938#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:36,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {3938#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:36,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {3963#(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; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:36,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {3963#(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; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:36,902 INFO L272 TraceCheckUtils]: 22: Hoare triple {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:43:36,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:43:36,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:43:36,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:43:36,904 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3899#true} {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {3963#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:36,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {3963#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:36,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {3988#(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; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:36,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {3988#(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; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:36,905 INFO L272 TraceCheckUtils]: 30: Hoare triple {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:43:36,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:43:36,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:43:36,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:43:36,906 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3899#true} {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #47#return; {3988#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:36,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {3988#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:36,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {4013#(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; {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:36,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {4013#(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; {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:36,908 INFO L272 TraceCheckUtils]: 38: Hoare triple {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:43:36,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:43:36,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:43:36,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:43:36,912 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3899#true} {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {4013#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:36,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {4013#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4038#(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:43:36,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {4038#(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; {4038#(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:43:36,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {4038#(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; {4038#(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:43:36,915 INFO L272 TraceCheckUtils]: 46: Hoare triple {4038#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:43:36,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:43:36,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:43:36,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:43:36,916 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3899#true} {4038#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} #47#return; {4038#(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:43:36,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {4038#(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); {4063#(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:43:36,916 INFO L272 TraceCheckUtils]: 52: Hoare triple {4063#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3899#true} is VALID [2022-02-20 17:43:36,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {3899#true} ~cond := #in~cond; {3899#true} is VALID [2022-02-20 17:43:36,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {3899#true} assume !(0 == ~cond); {3899#true} is VALID [2022-02-20 17:43:36,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {3899#true} assume true; {3899#true} is VALID [2022-02-20 17:43:36,917 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3899#true} {4063#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} #49#return; {4063#(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:43:36,918 INFO L272 TraceCheckUtils]: 57: Hoare triple {4063#(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 main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:36,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {4082#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4086#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:36,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {4086#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3900#false} is VALID [2022-02-20 17:43:36,919 INFO L290 TraceCheckUtils]: 60: Hoare triple {3900#false} assume !false; {3900#false} is VALID [2022-02-20 17:43:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:43:36,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:37,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:37,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535843741] [2022-02-20 17:43:37,229 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:37,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435273818] [2022-02-20 17:43:37,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435273818] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:37,229 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:37,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:43:37,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272927696] [2022-02-20 17:43:37,230 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:37,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 7 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 61 [2022-02-20 17:43:37,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:37,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 7 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:43:37,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:37,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:43:37,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:43:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:43:37,301 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 7 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:43:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:37,886 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 17:43:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:43:37,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 7 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 61 [2022-02-20 17:43:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 7 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:43:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-02-20 17:43:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 7 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:43:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-02-20 17:43:37,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2022-02-20 17:43:37,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:37,940 INFO L225 Difference]: With dead ends: 101 [2022-02-20 17:43:37,940 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 17:43:37,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 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:43:37,941 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:37,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:43:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 17:43:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 17:43:37,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:37,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:43:37,990 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:43:37,991 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:43:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:37,992 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-02-20 17:43:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-02-20 17:43:37,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:37,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:37,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 95 states. [2022-02-20 17:43:37,998 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 95 states. [2022-02-20 17:43:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:38,001 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-02-20 17:43:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-02-20 17:43:38,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:38,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:38,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:38,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:43:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-02-20 17:43:38,004 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 61 [2022-02-20 17:43:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:38,004 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-02-20 17:43:38,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 7 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:43:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-02-20 17:43:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 17:43:38,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:38,005 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:38,011 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:43:38,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:38,211 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:38,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:38,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1106405730, now seen corresponding path program 6 times [2022-02-20 17:43:38,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:38,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530978435] [2022-02-20 17:43:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:38,225 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:38,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705368991] [2022-02-20 17:43:38,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:43:38,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:38,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:38,227 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:43:38,237 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:43:38,854 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 17:43:38,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:38,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:43:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:38,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:39,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {4619#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; {4619#true} is VALID [2022-02-20 17:43:39,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {4619#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4619#true} is VALID [2022-02-20 17:43:39,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {4619#true} assume !(0 == assume_abort_if_not_~cond#1); {4619#true} is VALID [2022-02-20 17:43:39,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {4619#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4633#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:39,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {4633#(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; {4633#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:39,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {4633#(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; {4633#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:39,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {4633#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4619#true} {4633#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {4633#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:39,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {4633#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4658#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {4658#(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; {4658#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {4658#(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; {4658#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,412 INFO L272 TraceCheckUtils]: 14: Hoare triple {4658#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,413 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4619#true} {4658#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {4658#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {4658#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:39,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:39,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:39,415 INFO L272 TraceCheckUtils]: 22: Hoare triple {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,416 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4619#true} {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #47#return; {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:43:39,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {4683#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,418 INFO L272 TraceCheckUtils]: 30: Hoare triple {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,419 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4619#true} {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:39,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {4708#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:43:39,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:43:39,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:43:39,421 INFO L272 TraceCheckUtils]: 38: Hoare triple {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,422 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4619#true} {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} #47#return; {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:43:39,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {4733#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4758#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:39,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {4758#(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; {4758#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:39,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {4758#(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; {4758#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:39,424 INFO L272 TraceCheckUtils]: 46: Hoare triple {4758#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,425 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4619#true} {4758#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {4758#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:39,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {4758#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4783#(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:43:39,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {4783#(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; {4783#(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:43:39,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {4783#(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; {4783#(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:43:39,427 INFO L272 TraceCheckUtils]: 54: Hoare triple {4783#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,428 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4619#true} {4783#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #47#return; {4783#(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:43:39,429 INFO L290 TraceCheckUtils]: 59: Hoare triple {4783#(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); {4808#(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:43:39,429 INFO L272 TraceCheckUtils]: 60: Hoare triple {4808#(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 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {4619#true} is VALID [2022-02-20 17:43:39,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {4619#true} ~cond := #in~cond; {4619#true} is VALID [2022-02-20 17:43:39,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {4619#true} assume !(0 == ~cond); {4619#true} is VALID [2022-02-20 17:43:39,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {4619#true} assume true; {4619#true} is VALID [2022-02-20 17:43:39,430 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4619#true} {4808#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #49#return; {4808#(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:43:39,431 INFO L272 TraceCheckUtils]: 65: Hoare triple {4808#(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 main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:39,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {4827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:39,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {4831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4620#false} is VALID [2022-02-20 17:43:39,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {4620#false} assume !false; {4620#false} is VALID [2022-02-20 17:43:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:43:39,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:39,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:39,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530978435] [2022-02-20 17:43:39,744 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:39,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705368991] [2022-02-20 17:43:39,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705368991] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:39,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:39,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-02-20 17:43:39,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872487258] [2022-02-20 17:43:39,744 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:39,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 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 69 [2022-02-20 17:43:39,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:39,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 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:43:39,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:39,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:43:39,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:39,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:43:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:43:39,804 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 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:43:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:40,470 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-02-20 17:43:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:43:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 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 69 [2022-02-20 17:43:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 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:43:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-20 17:43:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 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:43:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-20 17:43:40,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 61 transitions. [2022-02-20 17:43:40,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:40,536 INFO L225 Difference]: With dead ends: 100 [2022-02-20 17:43:40,536 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 17:43:40,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:43:40,537 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:40,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:43:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 17:43:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-20 17:43:40,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:40,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:43:40,591 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:43:40,591 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:43:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:40,594 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-02-20 17:43:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-02-20 17:43:40,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:40,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:40,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-02-20 17:43:40,595 INFO L87 Difference]: Start difference. First operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-02-20 17:43:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:40,597 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-02-20 17:43:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-02-20 17:43:40,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:40,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:40,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:40,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:43:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-02-20 17:43:40,601 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 69 [2022-02-20 17:43:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:40,601 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-02-20 17:43:40,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 8 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:43:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-02-20 17:43:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 17:43:40,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:40,602 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:40,615 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:43:40,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:43:40,809 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash -317230276, now seen corresponding path program 7 times [2022-02-20 17:43:40,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:40,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763049704] [2022-02-20 17:43:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:40,823 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:40,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085162613] [2022-02-20 17:43:40,824 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:43:40,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:40,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:40,825 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:43:40,847 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:43:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:41,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 17:43:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:41,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:42,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {5358#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; {5358#true} is VALID [2022-02-20 17:43:42,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {5358#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5358#true} is VALID [2022-02-20 17:43:42,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {5358#true} assume !(0 == assume_abort_if_not_~cond#1); {5358#true} is VALID [2022-02-20 17:43:42,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {5358#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {5372#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:42,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {5372#(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; {5372#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:42,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {5372#(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; {5372#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:42,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {5372#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5358#true} {5372#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {5372#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:42,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {5372#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5397#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:42,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {5397#(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; {5397#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:42,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {5397#(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; {5397#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:42,009 INFO L272 TraceCheckUtils]: 14: Hoare triple {5397#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,010 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5358#true} {5397#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {5397#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:42,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {5397#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5422#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {5422#(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; {5422#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {5422#(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; {5422#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,012 INFO L272 TraceCheckUtils]: 22: Hoare triple {5422#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,013 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5358#true} {5422#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {5422#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {5422#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} is VALID [2022-02-20 17:43:42,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} is VALID [2022-02-20 17:43:42,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} is VALID [2022-02-20 17:43:42,015 INFO L272 TraceCheckUtils]: 30: Hoare triple {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,016 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5358#true} {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} #47#return; {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} is VALID [2022-02-20 17:43:42,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {5447#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5472#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:42,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {5472#(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; {5472#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:42,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {5472#(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; {5472#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:42,018 INFO L272 TraceCheckUtils]: 38: Hoare triple {5472#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,019 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5358#true} {5472#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #47#return; {5472#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:42,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {5472#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5497#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {5497#(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; {5497#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {5497#(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; {5497#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,020 INFO L272 TraceCheckUtils]: 46: Hoare triple {5497#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,021 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5358#true} {5497#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {5497#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,022 INFO L290 TraceCheckUtils]: 51: Hoare triple {5497#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5522#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {5522#(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; {5522#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {5522#(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; {5522#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,023 INFO L272 TraceCheckUtils]: 54: Hoare triple {5522#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,024 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5358#true} {5522#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} #47#return; {5522#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:42,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {5522#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:43:42,025 INFO L290 TraceCheckUtils]: 60: Hoare triple {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 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; {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:43:42,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 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; {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:43:42,026 INFO L272 TraceCheckUtils]: 62: Hoare triple {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,026 INFO L290 TraceCheckUtils]: 63: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,026 INFO L290 TraceCheckUtils]: 64: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,027 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5358#true} {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} #47#return; {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:43:42,028 INFO L290 TraceCheckUtils]: 67: Hoare triple {5547#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !(main_~c~0#1 < main_~k~0#1); {5572#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:42,028 INFO L272 TraceCheckUtils]: 68: Hoare triple {5572#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5358#true} is VALID [2022-02-20 17:43:42,028 INFO L290 TraceCheckUtils]: 69: Hoare triple {5358#true} ~cond := #in~cond; {5358#true} is VALID [2022-02-20 17:43:42,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {5358#true} assume !(0 == ~cond); {5358#true} is VALID [2022-02-20 17:43:42,029 INFO L290 TraceCheckUtils]: 71: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-02-20 17:43:42,029 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5358#true} {5572#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} #49#return; {5572#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:42,030 INFO L272 TraceCheckUtils]: 73: Hoare triple {5572#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5591#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:42,030 INFO L290 TraceCheckUtils]: 74: Hoare triple {5591#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5595#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:42,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {5595#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5359#false} is VALID [2022-02-20 17:43:42,031 INFO L290 TraceCheckUtils]: 76: Hoare triple {5359#false} assume !false; {5359#false} is VALID [2022-02-20 17:43:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 17:43:42,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:42,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:42,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763049704] [2022-02-20 17:43:42,342 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:42,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085162613] [2022-02-20 17:43:42,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085162613] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:42,343 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:42,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:43:42,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065334607] [2022-02-20 17:43:42,343 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 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 77 [2022-02-20 17:43:42,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:42,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 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:43:42,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:42,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:43:42,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:43:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:43:42,395 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 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:43:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:43,214 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-02-20 17:43:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:43:43,214 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 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 77 [2022-02-20 17:43:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 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:43:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 17:43:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 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:43:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 17:43:43,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-02-20 17:43:43,283 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:43:43,284 INFO L225 Difference]: With dead ends: 99 [2022-02-20 17:43:43,284 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 17:43:43,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:43:43,285 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:43,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 435 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:43:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 17:43:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-02-20 17:43:43,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:43,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:43,328 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:43,329 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:43,330 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 17:43:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 17:43:43,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:43,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:43,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 93 states. [2022-02-20 17:43:43,331 INFO L87 Difference]: Start difference. First operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 93 states. [2022-02-20 17:43:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:43,333 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 17:43:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 17:43:43,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:43,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:43,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:43,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-02-20 17:43:43,336 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 77 [2022-02-20 17:43:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:43,336 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-02-20 17:43:43,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 9 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:43:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 17:43:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 17:43:43,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:43,337 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:43,347 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:43:43,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 17:43:43,543 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1298793238, now seen corresponding path program 8 times [2022-02-20 17:43:43,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:43,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231224867] [2022-02-20 17:43:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:43,569 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:43,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024885823] [2022-02-20 17:43:43,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:43:43,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:43,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:43,571 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:43:43,573 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:43:44,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:43:44,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:44,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 17:43:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:44,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:44,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {6116#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; {6116#true} is VALID [2022-02-20 17:43:44,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {6116#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6116#true} is VALID [2022-02-20 17:43:44,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {6116#true} assume !(0 == assume_abort_if_not_~cond#1); {6116#true} is VALID [2022-02-20 17:43:44,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {6116#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {6130#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:44,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {6130#(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; {6130#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:44,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {6130#(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; {6130#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:44,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {6130#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6116#true} {6130#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {6130#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:44,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {6130#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6155#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:44,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {6155#(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; {6155#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:44,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {6155#(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; {6155#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:44,924 INFO L272 TraceCheckUtils]: 14: Hoare triple {6155#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,925 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6116#true} {6155#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {6155#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:44,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {6155#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6180#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {6180#(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; {6180#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {6180#(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; {6180#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,927 INFO L272 TraceCheckUtils]: 22: Hoare triple {6180#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,928 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6116#true} {6180#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {6180#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {6180#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6205#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:44,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {6205#(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; {6205#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:44,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {6205#(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; {6205#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:44,930 INFO L272 TraceCheckUtils]: 30: Hoare triple {6205#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,931 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6116#true} {6205#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #47#return; {6205#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:43:44,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {6205#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6230#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {6230#(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; {6230#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {6230#(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; {6230#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,933 INFO L272 TraceCheckUtils]: 38: Hoare triple {6230#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,934 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6116#true} {6230#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {6230#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {6230#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {6255#(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; {6255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {6255#(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; {6255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,936 INFO L272 TraceCheckUtils]: 46: Hoare triple {6255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,937 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6116#true} {6255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {6255#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:44,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {6255#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6280#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {6280#(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; {6280#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {6280#(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; {6280#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,939 INFO L272 TraceCheckUtils]: 54: Hoare triple {6280#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,940 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6116#true} {6280#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {6280#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {6280#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,942 INFO L272 TraceCheckUtils]: 62: Hoare triple {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,943 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6116#true} {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:43:44,944 INFO L290 TraceCheckUtils]: 67: Hoare triple {6305#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 4) (= 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:44,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:44,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:44,945 INFO L272 TraceCheckUtils]: 70: Hoare triple {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,945 INFO L290 TraceCheckUtils]: 71: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,945 INFO L290 TraceCheckUtils]: 72: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,946 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6116#true} {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} #47#return; {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:44,947 INFO L290 TraceCheckUtils]: 75: Hoare triple {6330#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {6355#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (<= |ULTIMATE.start_main_~k~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:44,947 INFO L272 TraceCheckUtils]: 76: Hoare triple {6355#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (<= |ULTIMATE.start_main_~k~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6116#true} is VALID [2022-02-20 17:43:44,947 INFO L290 TraceCheckUtils]: 77: Hoare triple {6116#true} ~cond := #in~cond; {6116#true} is VALID [2022-02-20 17:43:44,947 INFO L290 TraceCheckUtils]: 78: Hoare triple {6116#true} assume !(0 == ~cond); {6116#true} is VALID [2022-02-20 17:43:44,947 INFO L290 TraceCheckUtils]: 79: Hoare triple {6116#true} assume true; {6116#true} is VALID [2022-02-20 17:43:44,948 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6116#true} {6355#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (<= |ULTIMATE.start_main_~k~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} #49#return; {6355#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (<= |ULTIMATE.start_main_~k~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:44,949 INFO L272 TraceCheckUtils]: 81: Hoare triple {6355#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 4) (<= |ULTIMATE.start_main_~k~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:44,949 INFO L290 TraceCheckUtils]: 82: Hoare triple {6374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:44,950 INFO L290 TraceCheckUtils]: 83: Hoare triple {6378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6117#false} is VALID [2022-02-20 17:43:44,950 INFO L290 TraceCheckUtils]: 84: Hoare triple {6117#false} assume !false; {6117#false} is VALID [2022-02-20 17:43:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 17:43:44,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:45,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:45,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231224867] [2022-02-20 17:43:45,283 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:45,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024885823] [2022-02-20 17:43:45,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024885823] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:45,283 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:45,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-02-20 17:43:45,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315776847] [2022-02-20 17:43:45,283 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 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 85 [2022-02-20 17:43:45,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:45,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 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:43:45,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:45,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:43:45,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:43:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:43:45,332 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 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:43:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:46,235 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-02-20 17:43:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:43:46,236 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 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 85 [2022-02-20 17:43:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 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:43:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-02-20 17:43:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 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:43:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-02-20 17:43:46,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-02-20 17:43:46,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:46,302 INFO L225 Difference]: With dead ends: 98 [2022-02-20 17:43:46,302 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 17:43:46,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 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:43:46,306 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:46,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 510 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:43:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 17:43:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 17:43:46,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:46,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 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:43:46,355 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 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:43:46,355 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 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:43:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:46,357 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-02-20 17:43:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-02-20 17:43:46,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:46,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:46,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 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 92 states. [2022-02-20 17:43:46,358 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 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 92 states. [2022-02-20 17:43:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:46,360 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-02-20 17:43:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-02-20 17:43:46,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:46,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:46,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:46,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 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:43:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-02-20 17:43:46,362 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 85 [2022-02-20 17:43:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:46,362 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-02-20 17:43:46,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 10 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:43:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-02-20 17:43:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 17:43:46,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:46,363 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:46,375 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:43:46,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-20 17:43:46,570 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1207691024, now seen corresponding path program 9 times [2022-02-20 17:43:46,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:46,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814055576] [2022-02-20 17:43:46,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:46,584 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:46,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470347165] [2022-02-20 17:43:46,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:43:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:46,586 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:43:46,595 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:43:53,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-02-20 17:43:53,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:54,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 17:43:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:54,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:54,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {6893#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; {6893#true} is VALID [2022-02-20 17:43:54,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6893#true} is VALID [2022-02-20 17:43:54,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {6893#true} assume !(0 == assume_abort_if_not_~cond#1); {6893#true} is VALID [2022-02-20 17:43:54,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {6893#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {6907#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:54,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {6907#(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; {6907#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:54,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {6907#(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; {6907#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:54,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {6907#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6893#true} {6907#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {6907#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:54,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {6907#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6932#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:54,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {6932#(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; {6932#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:54,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {6932#(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; {6932#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:54,577 INFO L272 TraceCheckUtils]: 14: Hoare triple {6932#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,578 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6893#true} {6932#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {6932#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:43:54,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {6932#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6957#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {6957#(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; {6957#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {6957#(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; {6957#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,579 INFO L272 TraceCheckUtils]: 22: Hoare triple {6957#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,580 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6893#true} {6957#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {6957#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {6957#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6982#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {6982#(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; {6982#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {6982#(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; {6982#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,584 INFO L272 TraceCheckUtils]: 30: Hoare triple {6982#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,588 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6893#true} {6982#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #47#return; {6982#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {6982#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7007#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:54,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {7007#(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; {7007#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:54,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {7007#(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; {7007#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:54,590 INFO L272 TraceCheckUtils]: 38: Hoare triple {7007#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,591 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6893#true} {7007#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #47#return; {7007#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:43:54,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {7007#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7032#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {7032#(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; {7032#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {7032#(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; {7032#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,592 INFO L272 TraceCheckUtils]: 46: Hoare triple {7032#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,593 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6893#true} {7032#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {7032#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {7032#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,594 INFO L272 TraceCheckUtils]: 54: Hoare triple {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,594 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6893#true} {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #47#return; {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:54,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {7057#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,596 INFO L272 TraceCheckUtils]: 62: Hoare triple {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,596 INFO L290 TraceCheckUtils]: 64: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,596 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6893#true} {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #47#return; {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {7082#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,598 INFO L272 TraceCheckUtils]: 70: Hoare triple {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,598 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6893#true} {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} #47#return; {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:43:54,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {7107#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:43:54,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:43:54,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:43:54,600 INFO L272 TraceCheckUtils]: 78: Hoare triple {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,600 INFO L290 TraceCheckUtils]: 79: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,600 INFO L290 TraceCheckUtils]: 80: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,600 INFO L290 TraceCheckUtils]: 81: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,600 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {6893#true} {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} #47#return; {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:43:54,601 INFO L290 TraceCheckUtils]: 83: Hoare triple {7132#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9))} assume !(main_~c~0#1 < main_~k~0#1); {7157#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:54,602 INFO L272 TraceCheckUtils]: 84: Hoare triple {7157#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {6893#true} is VALID [2022-02-20 17:43:54,602 INFO L290 TraceCheckUtils]: 85: Hoare triple {6893#true} ~cond := #in~cond; {6893#true} is VALID [2022-02-20 17:43:54,602 INFO L290 TraceCheckUtils]: 86: Hoare triple {6893#true} assume !(0 == ~cond); {6893#true} is VALID [2022-02-20 17:43:54,602 INFO L290 TraceCheckUtils]: 87: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-02-20 17:43:54,602 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6893#true} {7157#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|))} #49#return; {7157#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:54,603 INFO L272 TraceCheckUtils]: 89: Hoare triple {7157#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7176#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:54,603 INFO L290 TraceCheckUtils]: 90: Hoare triple {7176#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7180#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:54,604 INFO L290 TraceCheckUtils]: 91: Hoare triple {7180#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6894#false} is VALID [2022-02-20 17:43:54,604 INFO L290 TraceCheckUtils]: 92: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2022-02-20 17:43:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 17:43:54,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:54,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:54,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814055576] [2022-02-20 17:43:54,905 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:54,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470347165] [2022-02-20 17:43:54,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470347165] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:54,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:54,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 17:43:54,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381622383] [2022-02-20 17:43:54,907 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 11 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 93 [2022-02-20 17:43:54,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:54,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 11 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:43:54,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:54,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:43:54,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:43:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:43:54,963 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 11 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:43:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:55,907 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-02-20 17:43:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 17:43:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 11 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 93 [2022-02-20 17:43:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 11 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:43:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 76 transitions. [2022-02-20 17:43:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 11 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:43:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 76 transitions. [2022-02-20 17:43:55,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 76 transitions. [2022-02-20 17:43:55,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:55,978 INFO L225 Difference]: With dead ends: 100 [2022-02-20 17:43:55,978 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 17:43:55,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 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:43:55,979 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:55,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 604 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:43:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 17:43:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-20 17:43:56,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:56,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:56,025 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:56,025 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:56,027 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-20 17:43:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-02-20 17:43:56,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:56,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:56,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 94 states. [2022-02-20 17:43:56,028 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 94 states. [2022-02-20 17:43:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:56,030 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-20 17:43:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-02-20 17:43:56,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:56,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:56,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:56,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:43:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-02-20 17:43:56,033 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-02-20 17:43:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:56,033 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-02-20 17:43:56,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 11 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:43:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-02-20 17:43:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 17:43:56,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:56,034 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:56,050 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:43:56,255 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,SelfDestructingSolverStorable14 [2022-02-20 17:43:56,255 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1956819211, now seen corresponding path program 2 times [2022-02-20 17:43:56,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:56,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745095893] [2022-02-20 17:43:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:56,270 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:56,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721497522] [2022-02-20 17:43:56,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:43:56,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:56,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:56,272 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:43:56,275 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:43:56,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:43:56,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:56,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:43:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:56,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:56,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {7705#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; {7710#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:56,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#(<= ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7710#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:56,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {7710#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {7710#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:56,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {7710#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {7710#(<= ~counter~0 0)} is VALID [2022-02-20 17:43:56,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {7710#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {7723#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {7723#(<= ~counter~0 1)} ~cond := #in~cond; {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {7723#(<= ~counter~0 1)} assume !(0 == ~cond); {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {7723#(<= ~counter~0 1)} assume true; {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7723#(<= ~counter~0 1)} {7723#(<= ~counter~0 1)} #47#return; {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {7723#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7723#(<= ~counter~0 1)} is VALID [2022-02-20 17:43:56,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {7723#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {7748#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,831 INFO L272 TraceCheckUtils]: 14: Hoare triple {7748#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {7748#(<= ~counter~0 2)} ~cond := #in~cond; {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {7748#(<= ~counter~0 2)} assume !(0 == ~cond); {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {7748#(<= ~counter~0 2)} assume true; {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,832 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7748#(<= ~counter~0 2)} {7748#(<= ~counter~0 2)} #47#return; {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {7748#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7748#(<= ~counter~0 2)} is VALID [2022-02-20 17:43:56,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {7748#(<= ~counter~0 2)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {7773#(<= ~counter~0 3)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,834 INFO L272 TraceCheckUtils]: 22: Hoare triple {7773#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {7773#(<= ~counter~0 3)} ~cond := #in~cond; {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {7773#(<= ~counter~0 3)} assume !(0 == ~cond); {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {7773#(<= ~counter~0 3)} assume true; {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,836 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7773#(<= ~counter~0 3)} {7773#(<= ~counter~0 3)} #47#return; {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {7773#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7773#(<= ~counter~0 3)} is VALID [2022-02-20 17:43:56,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {7773#(<= ~counter~0 3)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {7798#(<= ~counter~0 4)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,838 INFO L272 TraceCheckUtils]: 30: Hoare triple {7798#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {7798#(<= ~counter~0 4)} ~cond := #in~cond; {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {7798#(<= ~counter~0 4)} assume !(0 == ~cond); {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {7798#(<= ~counter~0 4)} assume true; {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,840 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7798#(<= ~counter~0 4)} {7798#(<= ~counter~0 4)} #47#return; {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {7798#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7798#(<= ~counter~0 4)} is VALID [2022-02-20 17:43:56,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {7798#(<= ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {7823#(<= ~counter~0 5)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,842 INFO L272 TraceCheckUtils]: 38: Hoare triple {7823#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {7823#(<= ~counter~0 5)} ~cond := #in~cond; {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {7823#(<= ~counter~0 5)} assume !(0 == ~cond); {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {7823#(<= ~counter~0 5)} assume true; {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,844 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7823#(<= ~counter~0 5)} {7823#(<= ~counter~0 5)} #47#return; {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {7823#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7823#(<= ~counter~0 5)} is VALID [2022-02-20 17:43:56,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {7823#(<= ~counter~0 5)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {7848#(<= ~counter~0 6)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,846 INFO L272 TraceCheckUtils]: 46: Hoare triple {7848#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {7848#(<= ~counter~0 6)} ~cond := #in~cond; {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {7848#(<= ~counter~0 6)} assume !(0 == ~cond); {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {7848#(<= ~counter~0 6)} assume true; {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,847 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7848#(<= ~counter~0 6)} {7848#(<= ~counter~0 6)} #47#return; {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {7848#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7848#(<= ~counter~0 6)} is VALID [2022-02-20 17:43:56,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {7848#(<= ~counter~0 6)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {7873#(<= ~counter~0 7)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,849 INFO L272 TraceCheckUtils]: 54: Hoare triple {7873#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {7873#(<= ~counter~0 7)} ~cond := #in~cond; {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {7873#(<= ~counter~0 7)} assume !(0 == ~cond); {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {7873#(<= ~counter~0 7)} assume true; {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,851 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7873#(<= ~counter~0 7)} {7873#(<= ~counter~0 7)} #47#return; {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {7873#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7873#(<= ~counter~0 7)} is VALID [2022-02-20 17:43:56,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {7873#(<= ~counter~0 7)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {7898#(<= ~counter~0 8)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,854 INFO L272 TraceCheckUtils]: 62: Hoare triple {7898#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {7898#(<= ~counter~0 8)} ~cond := #in~cond; {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {7898#(<= ~counter~0 8)} assume !(0 == ~cond); {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,855 INFO L290 TraceCheckUtils]: 65: Hoare triple {7898#(<= ~counter~0 8)} assume true; {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,855 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7898#(<= ~counter~0 8)} {7898#(<= ~counter~0 8)} #47#return; {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {7898#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7898#(<= ~counter~0 8)} is VALID [2022-02-20 17:43:56,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {7898#(<= ~counter~0 8)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,857 INFO L290 TraceCheckUtils]: 69: Hoare triple {7923#(<= ~counter~0 9)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,858 INFO L272 TraceCheckUtils]: 70: Hoare triple {7923#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,858 INFO L290 TraceCheckUtils]: 71: Hoare triple {7923#(<= ~counter~0 9)} ~cond := #in~cond; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {7923#(<= ~counter~0 9)} assume !(0 == ~cond); {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {7923#(<= ~counter~0 9)} assume true; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,859 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7923#(<= ~counter~0 9)} {7923#(<= ~counter~0 9)} #47#return; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {7923#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:56,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {7923#(<= ~counter~0 9)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {7948#(<= ~counter~0 10)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,861 INFO L272 TraceCheckUtils]: 78: Hoare triple {7948#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {7948#(<= ~counter~0 10)} ~cond := #in~cond; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {7948#(<= ~counter~0 10)} assume !(0 == ~cond); {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {7948#(<= ~counter~0 10)} assume true; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,863 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7948#(<= ~counter~0 10)} {7948#(<= ~counter~0 10)} #47#return; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {7948#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:56,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {7948#(<= ~counter~0 10)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7973#(<= |ULTIMATE.start_main_#t~post5#1| 10)} is VALID [2022-02-20 17:43:56,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {7973#(<= |ULTIMATE.start_main_#t~post5#1| 10)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7706#false} is VALID [2022-02-20 17:43:56,864 INFO L272 TraceCheckUtils]: 86: Hoare triple {7706#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7706#false} is VALID [2022-02-20 17:43:56,865 INFO L290 TraceCheckUtils]: 87: Hoare triple {7706#false} ~cond := #in~cond; {7706#false} is VALID [2022-02-20 17:43:56,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {7706#false} assume !(0 == ~cond); {7706#false} is VALID [2022-02-20 17:43:56,865 INFO L290 TraceCheckUtils]: 89: Hoare triple {7706#false} assume true; {7706#false} is VALID [2022-02-20 17:43:56,865 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {7706#false} {7706#false} #49#return; {7706#false} is VALID [2022-02-20 17:43:56,865 INFO L272 TraceCheckUtils]: 91: Hoare triple {7706#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7706#false} is VALID [2022-02-20 17:43:56,865 INFO L290 TraceCheckUtils]: 92: Hoare triple {7706#false} ~cond := #in~cond; {7706#false} is VALID [2022-02-20 17:43:56,865 INFO L290 TraceCheckUtils]: 93: Hoare triple {7706#false} assume 0 == ~cond; {7706#false} is VALID [2022-02-20 17:43:56,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {7706#false} assume !false; {7706#false} is VALID [2022-02-20 17:43:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:43:56,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:57,402 INFO L290 TraceCheckUtils]: 94: Hoare triple {7706#false} assume !false; {7706#false} is VALID [2022-02-20 17:43:57,402 INFO L290 TraceCheckUtils]: 93: Hoare triple {7706#false} assume 0 == ~cond; {7706#false} is VALID [2022-02-20 17:43:57,402 INFO L290 TraceCheckUtils]: 92: Hoare triple {7706#false} ~cond := #in~cond; {7706#false} is VALID [2022-02-20 17:43:57,402 INFO L272 TraceCheckUtils]: 91: Hoare triple {7706#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7706#false} is VALID [2022-02-20 17:43:57,402 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {7705#true} {7706#false} #49#return; {7706#false} is VALID [2022-02-20 17:43:57,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,402 INFO L290 TraceCheckUtils]: 87: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,402 INFO L272 TraceCheckUtils]: 86: Hoare triple {7706#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {8031#(< |ULTIMATE.start_main_#t~post5#1| 20)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7706#false} is VALID [2022-02-20 17:43:57,403 INFO L290 TraceCheckUtils]: 84: Hoare triple {8035#(< ~counter~0 20)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8031#(< |ULTIMATE.start_main_#t~post5#1| 20)} is VALID [2022-02-20 17:43:57,403 INFO L290 TraceCheckUtils]: 83: Hoare triple {8035#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8035#(< ~counter~0 20)} is VALID [2022-02-20 17:43:57,404 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7705#true} {8035#(< ~counter~0 20)} #47#return; {8035#(< ~counter~0 20)} is VALID [2022-02-20 17:43:57,404 INFO L290 TraceCheckUtils]: 81: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,404 INFO L290 TraceCheckUtils]: 80: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,404 INFO L290 TraceCheckUtils]: 79: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,404 INFO L272 TraceCheckUtils]: 78: Hoare triple {8035#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {8035#(< ~counter~0 20)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8035#(< ~counter~0 20)} is VALID [2022-02-20 17:43:57,405 INFO L290 TraceCheckUtils]: 76: Hoare triple {8060#(< ~counter~0 19)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8035#(< ~counter~0 20)} is VALID [2022-02-20 17:43:57,405 INFO L290 TraceCheckUtils]: 75: Hoare triple {8060#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8060#(< ~counter~0 19)} is VALID [2022-02-20 17:43:57,406 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7705#true} {8060#(< ~counter~0 19)} #47#return; {8060#(< ~counter~0 19)} is VALID [2022-02-20 17:43:57,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,406 INFO L290 TraceCheckUtils]: 72: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,406 INFO L290 TraceCheckUtils]: 71: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,406 INFO L272 TraceCheckUtils]: 70: Hoare triple {8060#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {8060#(< ~counter~0 19)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8060#(< ~counter~0 19)} is VALID [2022-02-20 17:43:57,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {8085#(< ~counter~0 18)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8060#(< ~counter~0 19)} is VALID [2022-02-20 17:43:57,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {8085#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8085#(< ~counter~0 18)} is VALID [2022-02-20 17:43:57,407 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7705#true} {8085#(< ~counter~0 18)} #47#return; {8085#(< ~counter~0 18)} is VALID [2022-02-20 17:43:57,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,408 INFO L272 TraceCheckUtils]: 62: Hoare triple {8085#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {8085#(< ~counter~0 18)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8085#(< ~counter~0 18)} is VALID [2022-02-20 17:43:57,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {8110#(< ~counter~0 17)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8085#(< ~counter~0 18)} is VALID [2022-02-20 17:43:57,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {8110#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8110#(< ~counter~0 17)} is VALID [2022-02-20 17:43:57,409 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7705#true} {8110#(< ~counter~0 17)} #47#return; {8110#(< ~counter~0 17)} is VALID [2022-02-20 17:43:57,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,409 INFO L272 TraceCheckUtils]: 54: Hoare triple {8110#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {8110#(< ~counter~0 17)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8110#(< ~counter~0 17)} is VALID [2022-02-20 17:43:57,410 INFO L290 TraceCheckUtils]: 52: Hoare triple {8135#(< ~counter~0 16)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8110#(< ~counter~0 17)} is VALID [2022-02-20 17:43:57,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {8135#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8135#(< ~counter~0 16)} is VALID [2022-02-20 17:43:57,411 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7705#true} {8135#(< ~counter~0 16)} #47#return; {8135#(< ~counter~0 16)} is VALID [2022-02-20 17:43:57,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,411 INFO L272 TraceCheckUtils]: 46: Hoare triple {8135#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {8135#(< ~counter~0 16)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8135#(< ~counter~0 16)} is VALID [2022-02-20 17:43:57,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {8160#(< ~counter~0 15)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8135#(< ~counter~0 16)} is VALID [2022-02-20 17:43:57,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {8160#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8160#(< ~counter~0 15)} is VALID [2022-02-20 17:43:57,412 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7705#true} {8160#(< ~counter~0 15)} #47#return; {8160#(< ~counter~0 15)} is VALID [2022-02-20 17:43:57,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,413 INFO L272 TraceCheckUtils]: 38: Hoare triple {8160#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {8160#(< ~counter~0 15)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8160#(< ~counter~0 15)} is VALID [2022-02-20 17:43:57,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {8185#(< ~counter~0 14)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8160#(< ~counter~0 15)} is VALID [2022-02-20 17:43:57,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {8185#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8185#(< ~counter~0 14)} is VALID [2022-02-20 17:43:57,414 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7705#true} {8185#(< ~counter~0 14)} #47#return; {8185#(< ~counter~0 14)} is VALID [2022-02-20 17:43:57,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,414 INFO L272 TraceCheckUtils]: 30: Hoare triple {8185#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {8185#(< ~counter~0 14)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8185#(< ~counter~0 14)} is VALID [2022-02-20 17:43:57,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {8210#(< ~counter~0 13)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8185#(< ~counter~0 14)} is VALID [2022-02-20 17:43:57,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {8210#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8210#(< ~counter~0 13)} is VALID [2022-02-20 17:43:57,416 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7705#true} {8210#(< ~counter~0 13)} #47#return; {8210#(< ~counter~0 13)} is VALID [2022-02-20 17:43:57,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,416 INFO L272 TraceCheckUtils]: 22: Hoare triple {8210#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {8210#(< ~counter~0 13)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8210#(< ~counter~0 13)} is VALID [2022-02-20 17:43:57,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {8235#(< ~counter~0 12)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8210#(< ~counter~0 13)} is VALID [2022-02-20 17:43:57,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {8235#(< ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8235#(< ~counter~0 12)} is VALID [2022-02-20 17:43:57,417 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7705#true} {8235#(< ~counter~0 12)} #47#return; {8235#(< ~counter~0 12)} is VALID [2022-02-20 17:43:57,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,418 INFO L272 TraceCheckUtils]: 14: Hoare triple {8235#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {8235#(< ~counter~0 12)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {8235#(< ~counter~0 12)} is VALID [2022-02-20 17:43:57,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {7948#(<= ~counter~0 10)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8235#(< ~counter~0 12)} is VALID [2022-02-20 17:43:57,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {7948#(<= ~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:57,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7705#true} {7948#(<= ~counter~0 10)} #47#return; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:57,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {7705#true} assume true; {7705#true} is VALID [2022-02-20 17:43:57,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {7705#true} assume !(0 == ~cond); {7705#true} is VALID [2022-02-20 17:43:57,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {7705#true} ~cond := #in~cond; {7705#true} is VALID [2022-02-20 17:43:57,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {7948#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7705#true} is VALID [2022-02-20 17:43:57,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {7948#(<= ~counter~0 10)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:57,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {7923#(<= ~counter~0 9)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7948#(<= ~counter~0 10)} is VALID [2022-02-20 17:43:57,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {7923#(<= ~counter~0 9)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:57,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {7923#(<= ~counter~0 9)} assume !(0 == assume_abort_if_not_~cond#1); {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:57,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {7923#(<= ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:57,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {7705#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; {7923#(<= ~counter~0 9)} is VALID [2022-02-20 17:43:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 17:43:57,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:57,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745095893] [2022-02-20 17:43:57,422 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:57,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721497522] [2022-02-20 17:43:57,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721497522] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:43:57,422 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:43:57,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-02-20 17:43:57,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146040493] [2022-02-20 17:43:57,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:57,423 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 20 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 95 [2022-02-20 17:43:57,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:57,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 20 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-02-20 17:43:57,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:57,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 17:43:57,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:57,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 17:43:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:43:57,537 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 20 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-02-20 17:43:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,544 INFO L93 Difference]: Finished difference Result 236 states and 256 transitions. [2022-02-20 17:43:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-20 17:43:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 20 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 95 [2022-02-20 17:43:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 20 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-02-20 17:43:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 245 transitions. [2022-02-20 17:43:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 20 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-02-20 17:43:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 245 transitions. [2022-02-20 17:43:58,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 245 transitions. [2022-02-20 17:43:58,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:58,754 INFO L225 Difference]: With dead ends: 236 [2022-02-20 17:43:58,754 INFO L226 Difference]: Without dead ends: 226 [2022-02-20 17:43:58,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 165 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:43:58,756 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 195 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:58,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 216 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:43:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-20 17:43:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2022-02-20 17:43:58,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:58,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 181 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 138 states have internal predecessors, (140), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:43:58,831 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 181 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 138 states have internal predecessors, (140), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:43:58,831 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 181 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 138 states have internal predecessors, (140), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:43:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,836 INFO L93 Difference]: Finished difference Result 226 states and 237 transitions. [2022-02-20 17:43:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 237 transitions. [2022-02-20 17:43:58,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:58,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:58,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 138 states have internal predecessors, (140), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) Second operand 226 states. [2022-02-20 17:43:58,837 INFO L87 Difference]: Start difference. First operand has 181 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 138 states have internal predecessors, (140), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) Second operand 226 states. [2022-02-20 17:43:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,842 INFO L93 Difference]: Finished difference Result 226 states and 237 transitions. [2022-02-20 17:43:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 237 transitions. [2022-02-20 17:43:58,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:58,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:58,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:58,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 138 states have internal predecessors, (140), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:43:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2022-02-20 17:43:58,847 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 95 [2022-02-20 17:43:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:58,847 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2022-02-20 17:43:58,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 20 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-02-20 17:43:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2022-02-20 17:43:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 17:43:58,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:58,849 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:58,874 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:43:59,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:59,063 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:59,064 INFO L85 PathProgramCache]: Analyzing trace with hash -939543350, now seen corresponding path program 10 times [2022-02-20 17:43:59,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:59,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109915534] [2022-02-20 17:43:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:59,080 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:59,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60892656] [2022-02-20 17:43:59,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:43:59,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:59,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:59,081 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:43:59,091 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:43:59,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:43:59,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:59,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 17:43:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:59,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:59,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {9370#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; {9370#true} is VALID [2022-02-20 17:43:59,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {9370#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {9370#true} is VALID [2022-02-20 17:43:59,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {9370#true} assume !(0 == assume_abort_if_not_~cond#1); {9370#true} is VALID [2022-02-20 17:43:59,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {9370#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {9384#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {9384#(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; {9384#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {9384#(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; {9384#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {9384#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9370#true} {9384#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {9384#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:59,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {9384#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9409#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:59,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {9409#(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; {9409#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:59,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {9409#(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; {9409#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:59,739 INFO L272 TraceCheckUtils]: 14: Hoare triple {9409#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,740 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9370#true} {9409#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {9409#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:59,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {9409#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9434#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:59,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {9434#(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; {9434#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:59,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {9434#(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; {9434#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:59,744 INFO L272 TraceCheckUtils]: 22: Hoare triple {9434#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,745 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9370#true} {9434#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #47#return; {9434#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:43:59,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {9434#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9459#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:59,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {9459#(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; {9459#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:59,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {9459#(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; {9459#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:59,746 INFO L272 TraceCheckUtils]: 30: Hoare triple {9459#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,747 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9370#true} {9459#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #47#return; {9459#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:43:59,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {9459#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9484#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {9484#(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; {9484#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {9484#(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; {9484#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,748 INFO L272 TraceCheckUtils]: 38: Hoare triple {9484#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,749 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9370#true} {9484#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #47#return; {9484#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {9484#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9509#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {9509#(and (= 2 (+ (- 3) |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; {9509#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {9509#(and (= 2 (+ (- 3) |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; {9509#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,750 INFO L272 TraceCheckUtils]: 46: Hoare triple {9509#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,751 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9370#true} {9509#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} #47#return; {9509#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {9509#(and (= 2 (+ (- 3) |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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,752 INFO L272 TraceCheckUtils]: 54: Hoare triple {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,752 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9370#true} {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} #47#return; {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:43:59,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {9534#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= (+ (- 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9559#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:43:59,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {9559#(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; {9559#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:43:59,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {9559#(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; {9559#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:43:59,754 INFO L272 TraceCheckUtils]: 62: Hoare triple {9559#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,754 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9370#true} {9559#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} #47#return; {9559#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ |ULTIMATE.start_main_~c~0#1| (- 4))))} is VALID [2022-02-20 17:43:59,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {9559#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:43:59,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:43:59,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:43:59,760 INFO L272 TraceCheckUtils]: 70: Hoare triple {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,761 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9370#true} {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} #47#return; {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:43:59,761 INFO L290 TraceCheckUtils]: 75: Hoare triple {9584#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 3) (= |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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:43:59,762 INFO L290 TraceCheckUtils]: 76: Hoare triple {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:43:59,762 INFO L290 TraceCheckUtils]: 77: Hoare triple {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:43:59,763 INFO L272 TraceCheckUtils]: 78: Hoare triple {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,763 INFO L290 TraceCheckUtils]: 79: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,763 INFO L290 TraceCheckUtils]: 80: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,763 INFO L290 TraceCheckUtils]: 81: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,764 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9370#true} {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} #47#return; {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:43:59,764 INFO L290 TraceCheckUtils]: 83: Hoare triple {9609#(and (= (+ |ULTIMATE.start_main_~c~0#1| (- 6)) 3) (= (+ (- 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:43:59,765 INFO L290 TraceCheckUtils]: 84: Hoare triple {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:43:59,765 INFO L290 TraceCheckUtils]: 85: Hoare triple {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:43:59,765 INFO L272 TraceCheckUtils]: 86: Hoare triple {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,766 INFO L290 TraceCheckUtils]: 87: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,766 INFO L290 TraceCheckUtils]: 88: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,766 INFO L290 TraceCheckUtils]: 89: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,766 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9370#true} {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} #47#return; {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} is VALID [2022-02-20 17:43:59,767 INFO L290 TraceCheckUtils]: 91: Hoare triple {9634#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 10))} assume !(main_~c~0#1 < main_~k~0#1); {9659#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 10))} is VALID [2022-02-20 17:43:59,768 INFO L272 TraceCheckUtils]: 92: Hoare triple {9659#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 10))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9370#true} is VALID [2022-02-20 17:43:59,768 INFO L290 TraceCheckUtils]: 93: Hoare triple {9370#true} ~cond := #in~cond; {9370#true} is VALID [2022-02-20 17:43:59,768 INFO L290 TraceCheckUtils]: 94: Hoare triple {9370#true} assume !(0 == ~cond); {9370#true} is VALID [2022-02-20 17:43:59,768 INFO L290 TraceCheckUtils]: 95: Hoare triple {9370#true} assume true; {9370#true} is VALID [2022-02-20 17:43:59,769 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9370#true} {9659#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 10))} #49#return; {9659#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 10))} is VALID [2022-02-20 17:43:59,769 INFO L272 TraceCheckUtils]: 97: Hoare triple {9659#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (= 8 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 10))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:59,770 INFO L290 TraceCheckUtils]: 98: Hoare triple {9678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:59,770 INFO L290 TraceCheckUtils]: 99: Hoare triple {9682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9371#false} is VALID [2022-02-20 17:43:59,770 INFO L290 TraceCheckUtils]: 100: Hoare triple {9371#false} assume !false; {9371#false} is VALID [2022-02-20 17:43:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-20 17:43:59,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:00,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:00,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109915534] [2022-02-20 17:44:00,043 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:00,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60892656] [2022-02-20 17:44:00,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60892656] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:00,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:00,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-02-20 17:44:00,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262041416] [2022-02-20 17:44:00,044 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:00,044 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 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 101 [2022-02-20 17:44:00,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:00,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 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:44:00,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:00,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:44:00,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:44:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:44:00,102 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 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:44:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:01,213 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2022-02-20 17:44:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:44:01,213 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 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 101 [2022-02-20 17:44:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 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:44:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-02-20 17:44:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 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:44:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-02-20 17:44:01,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-02-20 17:44:01,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:01,286 INFO L225 Difference]: With dead ends: 186 [2022-02-20 17:44:01,286 INFO L226 Difference]: Without dead ends: 180 [2022-02-20 17:44:01,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 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:44:01,287 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:01,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 678 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:44:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-20 17:44:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-02-20 17:44:01,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:01,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 180 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 137 states have internal predecessors, (139), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (29), 21 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:44:01,364 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 180 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 137 states have internal predecessors, (139), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (29), 21 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:44:01,364 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 180 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 137 states have internal predecessors, (139), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (29), 21 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:44:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:01,368 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2022-02-20 17:44:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2022-02-20 17:44:01,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:01,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:01,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 137 states have internal predecessors, (139), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (29), 21 states have call predecessors, (29), 29 states have call successors, (29) Second operand 180 states. [2022-02-20 17:44:01,369 INFO L87 Difference]: Start difference. First operand has 180 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 137 states have internal predecessors, (139), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (29), 21 states have call predecessors, (29), 29 states have call successors, (29) Second operand 180 states. [2022-02-20 17:44:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:01,373 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2022-02-20 17:44:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2022-02-20 17:44:01,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:01,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:01,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:01,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 137 states have internal predecessors, (139), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (29), 21 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:44:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2022-02-20 17:44:01,378 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 101 [2022-02-20 17:44:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:01,378 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2022-02-20 17:44:01,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 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:44:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2022-02-20 17:44:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-20 17:44:01,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:01,379 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:01,402 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:44:01,594 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,SelfDestructingSolverStorable16 [2022-02-20 17:44:01,594 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1584846500, now seen corresponding path program 11 times [2022-02-20 17:44:01,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:01,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389520250] [2022-02-20 17:44:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:01,616 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:01,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190815056] [2022-02-20 17:44:01,617 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:44:01,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:01,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:01,618 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:44:01,638 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:44:04,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-02-20 17:44:04,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:04,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-20 17:44:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:04,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:05,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {10625#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; {10625#true} is VALID [2022-02-20 17:44:05,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {10625#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {10625#true} is VALID [2022-02-20 17:44:05,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {10625#true} assume !(0 == assume_abort_if_not_~cond#1); {10625#true} is VALID [2022-02-20 17:44:05,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {10625#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {10639#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {10639#(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; {10639#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {10639#(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; {10639#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {10639#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10625#true} {10639#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {10639#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:05,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {10639#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10664#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {10664#(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; {10664#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {10664#(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; {10664#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,646 INFO L272 TraceCheckUtils]: 14: Hoare triple {10664#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,647 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10625#true} {10664#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #47#return; {10664#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:05,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {10664#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10689#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {10689#(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; {10689#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {10689#(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; {10689#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,649 INFO L272 TraceCheckUtils]: 22: Hoare triple {10689#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,649 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10625#true} {10689#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #47#return; {10689#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {10689#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10714#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {10714#(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; {10714#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {10714#(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; {10714#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,651 INFO L272 TraceCheckUtils]: 30: Hoare triple {10714#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,651 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10625#true} {10714#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} #47#return; {10714#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:05,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {10714#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10739#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:05,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {10739#(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; {10739#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:05,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {10739#(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; {10739#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:05,652 INFO L272 TraceCheckUtils]: 38: Hoare triple {10739#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,653 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10625#true} {10739#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #47#return; {10739#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:05,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {10739#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10764#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:05,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {10764#(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; {10764#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:05,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {10764#(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; {10764#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:05,654 INFO L272 TraceCheckUtils]: 46: Hoare triple {10764#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,655 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10625#true} {10764#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #47#return; {10764#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:05,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {10764#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10789#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {10789#(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; {10789#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {10789#(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; {10789#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,656 INFO L272 TraceCheckUtils]: 54: Hoare triple {10789#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,657 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10625#true} {10789#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {10789#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {10789#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,658 INFO L272 TraceCheckUtils]: 62: Hoare triple {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,658 INFO L290 TraceCheckUtils]: 63: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,658 INFO L290 TraceCheckUtils]: 64: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,662 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10625#true} {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} #47#return; {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {10814#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,663 INFO L290 TraceCheckUtils]: 68: Hoare triple {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,663 INFO L290 TraceCheckUtils]: 69: Hoare triple {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,663 INFO L272 TraceCheckUtils]: 70: Hoare triple {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,663 INFO L290 TraceCheckUtils]: 72: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,664 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10625#true} {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #47#return; {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:05,664 INFO L290 TraceCheckUtils]: 75: Hoare triple {10839#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10864#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {10864#(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; {10864#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {10864#(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; {10864#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,665 INFO L272 TraceCheckUtils]: 78: Hoare triple {10864#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,665 INFO L290 TraceCheckUtils]: 80: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,666 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10625#true} {10864#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} #47#return; {10864#(and (= 7 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:44:05,666 INFO L290 TraceCheckUtils]: 83: Hoare triple {10864#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:44:05,667 INFO L290 TraceCheckUtils]: 84: Hoare triple {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:44:05,667 INFO L290 TraceCheckUtils]: 85: Hoare triple {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:44:05,667 INFO L272 TraceCheckUtils]: 86: Hoare triple {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,667 INFO L290 TraceCheckUtils]: 87: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,667 INFO L290 TraceCheckUtils]: 88: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,667 INFO L290 TraceCheckUtils]: 89: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,668 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {10625#true} {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} #47#return; {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:44:05,668 INFO L290 TraceCheckUtils]: 91: Hoare triple {10889#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 7) (= (+ (- 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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:44:05,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |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; {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:44:05,669 INFO L290 TraceCheckUtils]: 93: Hoare triple {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:44:05,669 INFO L272 TraceCheckUtils]: 94: Hoare triple {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,669 INFO L290 TraceCheckUtils]: 95: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,669 INFO L290 TraceCheckUtils]: 96: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,669 INFO L290 TraceCheckUtils]: 97: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,670 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10625#true} {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} #47#return; {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:44:05,670 INFO L290 TraceCheckUtils]: 99: Hoare triple {10914#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~c~0#1| 11))} assume !(main_~c~0#1 < main_~k~0#1); {10939#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 11))} is VALID [2022-02-20 17:44:05,670 INFO L272 TraceCheckUtils]: 100: Hoare triple {10939#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 11))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {10625#true} is VALID [2022-02-20 17:44:05,670 INFO L290 TraceCheckUtils]: 101: Hoare triple {10625#true} ~cond := #in~cond; {10625#true} is VALID [2022-02-20 17:44:05,670 INFO L290 TraceCheckUtils]: 102: Hoare triple {10625#true} assume !(0 == ~cond); {10625#true} is VALID [2022-02-20 17:44:05,670 INFO L290 TraceCheckUtils]: 103: Hoare triple {10625#true} assume true; {10625#true} is VALID [2022-02-20 17:44:05,671 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10625#true} {10939#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 11))} #49#return; {10939#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 11))} is VALID [2022-02-20 17:44:05,671 INFO L272 TraceCheckUtils]: 105: Hoare triple {10939#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 11))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {10958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:05,672 INFO L290 TraceCheckUtils]: 106: Hoare triple {10958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:05,672 INFO L290 TraceCheckUtils]: 107: Hoare triple {10962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10626#false} is VALID [2022-02-20 17:44:05,672 INFO L290 TraceCheckUtils]: 108: Hoare triple {10626#false} assume !false; {10626#false} is VALID [2022-02-20 17:44:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-02-20 17:44:05,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:05,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:05,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389520250] [2022-02-20 17:44:05,925 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:05,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190815056] [2022-02-20 17:44:05,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190815056] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:05,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:05,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-02-20 17:44:05,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69138168] [2022-02-20 17:44:05,926 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 13 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 109 [2022-02-20 17:44:05,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:05,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 13 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:44:05,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:05,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 17:44:05,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:05,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 17:44:05,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:44:05,990 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 13 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:44:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:07,264 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2022-02-20 17:44:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 17:44:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 13 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 109 [2022-02-20 17:44:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 13 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:44:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-02-20 17:44:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 13 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:44:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-02-20 17:44:07,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2022-02-20 17:44:07,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:07,354 INFO L225 Difference]: With dead ends: 185 [2022-02-20 17:44:07,354 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 17:44:07,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:44:07,355 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:07,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 771 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:44:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 17:44:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-02-20 17:44:07,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:07,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 179 states, 129 states have (on average 1.069767441860465) internal successors, (138), 136 states have internal predecessors, (138), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (28), 21 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 17:44:07,447 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 179 states, 129 states have (on average 1.069767441860465) internal successors, (138), 136 states have internal predecessors, (138), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (28), 21 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 17:44:07,447 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 179 states, 129 states have (on average 1.069767441860465) internal successors, (138), 136 states have internal predecessors, (138), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (28), 21 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 17:44:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:07,450 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2022-02-20 17:44:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2022-02-20 17:44:07,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:07,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:07,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 129 states have (on average 1.069767441860465) internal successors, (138), 136 states have internal predecessors, (138), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (28), 21 states have call predecessors, (28), 28 states have call successors, (28) Second operand 179 states. [2022-02-20 17:44:07,452 INFO L87 Difference]: Start difference. First operand has 179 states, 129 states have (on average 1.069767441860465) internal successors, (138), 136 states have internal predecessors, (138), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (28), 21 states have call predecessors, (28), 28 states have call successors, (28) Second operand 179 states. [2022-02-20 17:44:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:07,455 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2022-02-20 17:44:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2022-02-20 17:44:07,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:07,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:07,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:07,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 129 states have (on average 1.069767441860465) internal successors, (138), 136 states have internal predecessors, (138), 29 states have call successors, (29), 21 states have call predecessors, (29), 20 states have return successors, (28), 21 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 17:44:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2022-02-20 17:44:07,459 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 109 [2022-02-20 17:44:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:07,460 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2022-02-20 17:44:07,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 13 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:44:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2022-02-20 17:44:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-02-20 17:44:07,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:07,462 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:07,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:07,670 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,SelfDestructingSolverStorable17 [2022-02-20 17:44:07,671 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1568440706, now seen corresponding path program 12 times [2022-02-20 17:44:07,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:07,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921535255] [2022-02-20 17:44:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:07,699 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:07,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262322001] [2022-02-20 17:44:07,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:44:07,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:07,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:07,708 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:44:07,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process