./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.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 173419c809fa8cb7fa094fdfc7b5765802a9a2fdebfe9d0a53cd745fd0c573d2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:14:46,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:14:46,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:14:46,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:14:46,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:14:46,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:14:46,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:14:46,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:14:46,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:14:46,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:14:46,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:14:46,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:14:46,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:14:46,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:14:46,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:14:46,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:14:46,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:14:46,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:14:46,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:14:46,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:14:46,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:14:46,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:14:46,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:14:46,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:14:46,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:14:46,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:14:46,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:14:46,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:14:46,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:14:46,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:14:46,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:14:46,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:14:46,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:14:46,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:14:46,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:14:46,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:14:46,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:14:46,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:14:46,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:14:46,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:14:46,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:14:46,208 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:14:46,232 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:14:46,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:14:46,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:14:46,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:14:46,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:14:46,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:14:46,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:14:46,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:14:46,235 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:14:46,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:14:46,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:14:46,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:14:46,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:14:46,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:14:46,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:14:46,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:14:46,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:14:46,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:14:46,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:14:46,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:14:46,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:14:46,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:14:46,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:14:46,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:14:46,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:46,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:14:46,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:14:46,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:14:46,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:14:46,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:14:46,239 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:14:46,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:14:46,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:14:46,239 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 -> 173419c809fa8cb7fa094fdfc7b5765802a9a2fdebfe9d0a53cd745fd0c573d2 [2022-02-20 17:14:46,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:14:46,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:14:46,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:14:46,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:14:46,472 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:14:46,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-02-20 17:14:46,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a98d73b/923c07c0c6674ce283eb65f02e7aa939/FLAG532230a69 [2022-02-20 17:14:46,856 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:14:46,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2022-02-20 17:14:46,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a98d73b/923c07c0c6674ce283eb65f02e7aa939/FLAG532230a69 [2022-02-20 17:14:46,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a98d73b/923c07c0c6674ce283eb65f02e7aa939 [2022-02-20 17:14:46,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:14:46,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:14:46,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:46,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:14:46,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:14:46,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:46" (1/1) ... [2022-02-20 17:14:46,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c0c404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:46, skipping insertion in model container [2022-02-20 17:14:46,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:46" (1/1) ... [2022-02-20 17:14:46,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:14:46,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:14:47,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-02-20 17:14:47,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:47,075 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:14:47,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c[588,601] [2022-02-20 17:14:47,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:47,114 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:14:47,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47 WrapperNode [2022-02-20 17:14:47,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:47,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:47,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:14:47,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:14:47,120 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:14:47" (1/1) ... [2022-02-20 17:14:47,124 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:14:47" (1/1) ... [2022-02-20 17:14:47,137 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-02-20 17:14:47,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:47,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:14:47,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:14:47,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:14:47,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:14:47,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:14:47,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:14:47,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:14:47,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (1/1) ... [2022-02-20 17:14:47,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:47,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:47,196 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:14:47,214 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:14:47,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:14:47,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:14:47,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:14:47,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:14:47,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:14:47,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:14:47,264 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:14:47,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:14:47,418 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:14:47,435 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:14:47,436 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:14:47,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:47 BoogieIcfgContainer [2022-02-20 17:14:47,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:14:47,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:14:47,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:14:47,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:14:47,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:14:46" (1/3) ... [2022-02-20 17:14:47,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363597ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:47, skipping insertion in model container [2022-02-20 17:14:47,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:47" (2/3) ... [2022-02-20 17:14:47,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363597ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:47, skipping insertion in model container [2022-02-20 17:14:47,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:47" (3/3) ... [2022-02-20 17:14:47,455 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound5.c [2022-02-20 17:14:47,458 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:14:47,459 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:14:47,511 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:14:47,518 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:14:47,518 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:14:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:14:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:14:47,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:47,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:47,547 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-02-20 17:14:47,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:47,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662157514] [2022-02-20 17:14:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:47,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-02-20 17:14:47,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {29#true} is VALID [2022-02-20 17:14:47,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 17:14:47,699 INFO L272 TraceCheckUtils]: 3: Hoare triple {30#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {30#false} is VALID [2022-02-20 17:14:47,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:14:47,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:14:47,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:14:47,701 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:14:47,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:47,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662157514] [2022-02-20 17:14:47,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662157514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:47,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:47,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:14:47,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537739002] [2022-02-20 17:14:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:47,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:14:47,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:47,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:47,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:47,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:14:47,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:47,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:14:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:14:47,756 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:47,831 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-02-20 17:14:47,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:14:47,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:14:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:47,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:14:47,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:47,970 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:47,970 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:14:47,973 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:14:47,976 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:47,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:14:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:14:48,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:48,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,003 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,004 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,008 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:48,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:48,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:48,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 22 states. [2022-02-20 17:14:48,010 INFO L87 Difference]: Start difference. First operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 22 states. [2022-02-20 17:14:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,015 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:48,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:48,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:48,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:48,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-02-20 17:14:48,027 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-02-20 17:14:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:48,028 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-02-20 17:14:48,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:48,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:48,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:48,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:14:48,031 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-02-20 17:14:48,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:48,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668871318] [2022-02-20 17:14:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:48,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:48,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {192#(= ~counter~0 0)} is VALID [2022-02-20 17:14:48,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#(= ~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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {192#(= ~counter~0 0)} is VALID [2022-02-20 17:14:48,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {193#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:14:48,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 5);havoc main_#t~post5#1; {191#false} is VALID [2022-02-20 17:14:48,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {191#false} is VALID [2022-02-20 17:14:48,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-02-20 17:14:48,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-02-20 17:14:48,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 17:14:48,119 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:14:48,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:48,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668871318] [2022-02-20 17:14:48,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668871318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:48,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:48,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:14:48,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977534757] [2022-02-20 17:14:48,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:48,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:14:48,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:48,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:48,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:14:48,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:14:48,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:14:48,130 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,237 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-20 17:14:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:14:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:14:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:48,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-02-20 17:14:48,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:48,303 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:14:48,303 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:14:48,306 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:14:48,308 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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:14:48,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:14:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:14:48,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:48,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,316 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,316 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,318 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:48,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:48,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:48,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 24 states. [2022-02-20 17:14:48,323 INFO L87 Difference]: Start difference. First operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 24 states. [2022-02-20 17:14:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,326 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:48,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:48,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:48,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:48,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-02-20 17:14:48,330 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-02-20 17:14:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:48,331 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-02-20 17:14:48,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:48,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:48,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:48,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:14:48,334 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-02-20 17:14:48,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:48,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121207162] [2022-02-20 17:14:48,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:48,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {339#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {339#true} is VALID [2022-02-20 17:14:48,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:14:48,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:14:48,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:14:48,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:48,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:14:48,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {340#false} is VALID [2022-02-20 17:14:48,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-02-20 17:14:48,413 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:14:48,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:48,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121207162] [2022-02-20 17:14:48,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121207162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:48,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:48,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:48,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223009839] [2022-02-20 17:14:48,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:48,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:14:48,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:48,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:48,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:48,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:48,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:48,422 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,586 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 17:14:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:14:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:14:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:14:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:14:48,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 17:14:48,623 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:14:48,624 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:14:48,624 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:14:48,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:14:48,625 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:48,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 84 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:14:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:14:48,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:48,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,630 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,630 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,632 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-02-20 17:14:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:48,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:48,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:48,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 28 states. [2022-02-20 17:14:48,633 INFO L87 Difference]: Start difference. First operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 28 states. [2022-02-20 17:14:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,634 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-02-20 17:14:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:48,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:48,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:48,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:48,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-02-20 17:14:48,636 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2022-02-20 17:14:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:48,637 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-02-20 17:14:48,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:14:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:14:48,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:48,637 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:48,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:14:48,638 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-02-20 17:14:48,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:48,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345903100] [2022-02-20 17:14:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:48,652 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:48,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884580198] [2022-02-20 17:14:48,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:48,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:48,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:48,659 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:14:48,665 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:14:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:48,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:14:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:48,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:48,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {492#true} is VALID [2022-02-20 17:14:48,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:48,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:48,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:48,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {492#true} is VALID [2022-02-20 17:14:48,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} ~cond := #in~cond; {492#true} is VALID [2022-02-20 17:14:48,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {492#true} assume !(0 == ~cond); {492#true} is VALID [2022-02-20 17:14:48,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 17:14:48,793 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {492#true} {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #48#return; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:48,794 INFO L272 TraceCheckUtils]: 9: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:48,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:48,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {493#false} is VALID [2022-02-20 17:14:48,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-20 17:14:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:48,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:48,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:48,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345903100] [2022-02-20 17:14:48,796 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:48,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884580198] [2022-02-20 17:14:48,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884580198] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:48,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:48,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:48,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210217498] [2022-02-20 17:14:48,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2022-02-20 17:14:48,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:48,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:14:48,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:48,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:48,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:48,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:48,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:48,816 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:14:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,082 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-02-20 17:14:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:49,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2022-02-20 17:14:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:14:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:14:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:49,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:49,169 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:14:49,171 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:14:49,171 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:14:49,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:14:49,172 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:49,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:14:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-02-20 17:14:49,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:49,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:49,178 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:49,179 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,181 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:49,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:14:49,182 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:14:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,184 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:49,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:49,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 17:14:49,186 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2022-02-20 17:14:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:49,186 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 17:14:49,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:14:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 17:14:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:14:49,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:49,187 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:49,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:14:49,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:49,388 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-02-20 17:14:49,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:49,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81611574] [2022-02-20 17:14:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:49,397 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:49,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103425713] [2022-02-20 17:14:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:49,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:49,399 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:14:49,401 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:14:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:49,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:14:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:49,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:49,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {750#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {750#true} is VALID [2022-02-20 17:14:49,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {750#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:49,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:49,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:49,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {750#true} is VALID [2022-02-20 17:14:49,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {750#true} ~cond := #in~cond; {750#true} is VALID [2022-02-20 17:14:49,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {750#true} assume !(0 == ~cond); {750#true} is VALID [2022-02-20 17:14:49,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {750#true} assume true; {750#true} is VALID [2022-02-20 17:14:49,553 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {750#true} {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #48#return; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:49,553 INFO L272 TraceCheckUtils]: 9: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {750#true} is VALID [2022-02-20 17:14:49,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {750#true} ~cond := #in~cond; {750#true} is VALID [2022-02-20 17:14:49,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {750#true} assume !(0 == ~cond); {750#true} is VALID [2022-02-20 17:14:49,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {750#true} assume true; {750#true} is VALID [2022-02-20 17:14:49,554 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {750#true} {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #50#return; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:49,555 INFO L272 TraceCheckUtils]: 14: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:49,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:49,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {751#false} is VALID [2022-02-20 17:14:49,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {751#false} assume !false; {751#false} is VALID [2022-02-20 17:14:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:14:49,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:49,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:49,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81611574] [2022-02-20 17:14:49,556 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:49,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103425713] [2022-02-20 17:14:49,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103425713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:49,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:49,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:49,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289836885] [2022-02-20 17:14:49,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:49,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:14:49,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:49,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:49,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:49,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:49,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:49,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:49,569 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,747 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-02-20 17:14:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:14:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:49,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:49,806 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:14:49,808 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:49,808 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:14:49,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:14:49,809 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:49,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:14:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:14:49,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:49,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,817 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,817 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,819 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:49,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:14:49,821 INFO L87 Difference]: Start difference. First operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:14:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,823 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:49,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:49,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 17:14:49,826 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-02-20 17:14:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:49,826 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 17:14:49,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 17:14:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:14:49,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:49,827 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:49,854 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:14:50,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:50,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-02-20 17:14:50,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:50,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965902019] [2022-02-20 17:14:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:50,062 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:50,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550526685] [2022-02-20 17:14:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:50,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:50,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:50,064 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:14:50,065 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:14:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:50,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:14:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:50,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:50,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1052#true} is VALID [2022-02-20 17:14:50,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:50,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:50,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:50,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1052#true} is VALID [2022-02-20 17:14:50,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:50,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:50,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:50,231 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1052#true} {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #48#return; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:50,232 INFO L272 TraceCheckUtils]: 9: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1052#true} is VALID [2022-02-20 17:14:50,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:50,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:50,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:50,232 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1052#true} {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #50#return; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:50,233 INFO L272 TraceCheckUtils]: 14: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1052#true} is VALID [2022-02-20 17:14:50,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:50,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:50,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:50,234 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1052#true} {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #52#return; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:50,234 INFO L272 TraceCheckUtils]: 19: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:50,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:50,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1053#false} is VALID [2022-02-20 17:14:50,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2022-02-20 17:14:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:14:50,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:50,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:50,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965902019] [2022-02-20 17:14:50,236 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:50,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550526685] [2022-02-20 17:14:50,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550526685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:50,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:50,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:50,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747697345] [2022-02-20 17:14:50,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:50,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-20 17:14:50,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:50,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:50,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:50,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:50,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:50,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:50,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:50,256 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:50,457 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-02-20 17:14:50,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:50,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-20 17:14:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:50,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:50,513 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:14:50,514 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:14:50,514 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:14:50,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:14:50,515 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:50,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 141 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:14:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:14:50,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:50,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:50,523 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:50,523 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:50,525 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:14:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:50,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:50,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:50,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:14:50,526 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:14:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:50,527 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:14:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:50,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:50,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:50,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:50,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-02-20 17:14:50,530 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-02-20 17:14:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:50,530 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-02-20 17:14:50,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:14:50,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:50,531 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:50,549 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:14:50,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:50,749 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2022-02-20 17:14:50,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:50,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936070889] [2022-02-20 17:14:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:50,759 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:50,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646423375] [2022-02-20 17:14:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:50,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:50,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:50,761 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:14:50,762 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:14:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:50,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:14:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:50,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:50,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:14:50,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#(<= ~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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1381#(<= ~counter~0 0)} is VALID [2022-02-20 17:14:50,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1381#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {1388#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {1388#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,965 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1388#(<= ~counter~0 1)} {1388#(<= ~counter~0 1)} #48#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,966 INFO L272 TraceCheckUtils]: 9: Hoare triple {1388#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,967 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1388#(<= ~counter~0 1)} {1388#(<= ~counter~0 1)} #50#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,968 INFO L272 TraceCheckUtils]: 14: Hoare triple {1388#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,969 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1388#(<= ~counter~0 1)} {1388#(<= ~counter~0 1)} #52#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {1388#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,971 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1388#(<= ~counter~0 1)} {1388#(<= ~counter~0 1)} #54#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,971 INFO L272 TraceCheckUtils]: 24: Hoare triple {1388#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,975 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1388#(<= ~counter~0 1)} {1388#(<= ~counter~0 1)} #56#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {1388#(<= ~counter~0 1)} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:50,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {1388#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1473#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:14:50,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {1473#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1377#false} is VALID [2022-02-20 17:14:50,977 INFO L272 TraceCheckUtils]: 32: Hoare triple {1377#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1377#false} is VALID [2022-02-20 17:14:50,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:14:50,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {1377#false} assume !(0 == ~cond); {1377#false} is VALID [2022-02-20 17:14:50,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {1377#false} assume true; {1377#false} is VALID [2022-02-20 17:14:50,986 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1377#false} {1377#false} #58#return; {1377#false} is VALID [2022-02-20 17:14:50,987 INFO L272 TraceCheckUtils]: 37: Hoare triple {1377#false} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1377#false} is VALID [2022-02-20 17:14:50,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:14:50,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {1377#false} assume 0 == ~cond; {1377#false} is VALID [2022-02-20 17:14:50,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-02-20 17:14:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 17:14:51,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:51,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-02-20 17:14:51,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {1377#false} assume 0 == ~cond; {1377#false} is VALID [2022-02-20 17:14:51,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:14:51,135 INFO L272 TraceCheckUtils]: 37: Hoare triple {1377#false} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1377#false} is VALID [2022-02-20 17:14:51,135 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1376#true} {1377#false} #58#return; {1377#false} is VALID [2022-02-20 17:14:51,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:51,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:51,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:51,136 INFO L272 TraceCheckUtils]: 32: Hoare triple {1377#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1376#true} is VALID [2022-02-20 17:14:51,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {1531#(< |ULTIMATE.start_main_#t~post5#1| 5)} assume !(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1377#false} is VALID [2022-02-20 17:14:51,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {1535#(< ~counter~0 5)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1531#(< |ULTIMATE.start_main_#t~post5#1| 5)} is VALID [2022-02-20 17:14:51,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {1535#(< ~counter~0 5)} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,138 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1376#true} {1535#(< ~counter~0 5)} #56#return; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:51,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:51,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:51,138 INFO L272 TraceCheckUtils]: 24: Hoare triple {1535#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {1376#true} is VALID [2022-02-20 17:14:51,139 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1376#true} {1535#(< ~counter~0 5)} #54#return; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:51,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:51,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:51,139 INFO L272 TraceCheckUtils]: 19: Hoare triple {1535#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1376#true} is VALID [2022-02-20 17:14:51,140 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1376#true} {1535#(< ~counter~0 5)} #52#return; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:51,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:51,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:51,140 INFO L272 TraceCheckUtils]: 14: Hoare triple {1535#(< ~counter~0 5)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1376#true} is VALID [2022-02-20 17:14:51,141 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1376#true} {1535#(< ~counter~0 5)} #50#return; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:51,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:51,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:51,141 INFO L272 TraceCheckUtils]: 9: Hoare triple {1535#(< ~counter~0 5)} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1376#true} is VALID [2022-02-20 17:14:51,143 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1376#true} {1535#(< ~counter~0 5)} #48#return; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:51,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:51,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:51,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#(< ~counter~0 5)} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1376#true} is VALID [2022-02-20 17:14:51,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {1535#(< ~counter~0 5)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#(< ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1535#(< ~counter~0 5)} is VALID [2022-02-20 17:14:51,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#(< ~counter~0 4)} 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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1620#(< ~counter~0 4)} is VALID [2022-02-20 17:14:51,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1620#(< ~counter~0 4)} is VALID [2022-02-20 17:14:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:14:51,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:51,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936070889] [2022-02-20 17:14:51,146 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:51,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646423375] [2022-02-20 17:14:51,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646423375] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:51,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:51,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:14:51,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437201953] [2022-02-20 17:14:51,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:51,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2022-02-20 17:14:51,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:51,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:14:51,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:51,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:14:51,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:51,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:14:51,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:14:51,184 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:14:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:51,586 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2022-02-20 17:14:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:14:51,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2022-02-20 17:14:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:14:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-02-20 17:14:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:14:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-02-20 17:14:51,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 130 transitions. [2022-02-20 17:14:51,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:51,712 INFO L225 Difference]: With dead ends: 116 [2022-02-20 17:14:51,712 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 17:14:51,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:14:51,713 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 56 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:51,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 225 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:14:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 17:14:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-02-20 17:14:51,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:51,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:51,751 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:51,752 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:51,763 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2022-02-20 17:14:51,764 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2022-02-20 17:14:51,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:51,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:51,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 100 states. [2022-02-20 17:14:51,765 INFO L87 Difference]: Start difference. First operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 100 states. [2022-02-20 17:14:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:51,768 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2022-02-20 17:14:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2022-02-20 17:14:51,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:51,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:51,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:51,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-02-20 17:14:51,773 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 41 [2022-02-20 17:14:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:51,774 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-02-20 17:14:51,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 17:14:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-02-20 17:14:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:14:51,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:51,777 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:51,796 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:14:51,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:51,988 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 1 times [2022-02-20 17:14:51,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:51,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700541484] [2022-02-20 17:14:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:51,997 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:51,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145665812] [2022-02-20 17:14:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:51,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:51,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:51,999 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:14:52,001 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:14:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:52,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:14:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:52,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:52,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {2158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2158#true} is VALID [2022-02-20 17:14:52,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {2158#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,238 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2158#true} {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #48#return; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,238 INFO L272 TraceCheckUtils]: 9: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,239 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2158#true} {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #50#return; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,239 INFO L272 TraceCheckUtils]: 14: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,240 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2158#true} {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #52#return; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,240 INFO L272 TraceCheckUtils]: 19: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,241 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2158#true} {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,241 INFO L272 TraceCheckUtils]: 24: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,241 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2158#true} {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {2166#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:52,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:52,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:52,243 INFO L272 TraceCheckUtils]: 32: Hoare triple {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,244 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2158#true} {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} #48#return; {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:52,244 INFO L272 TraceCheckUtils]: 37: Hoare triple {2251#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:52,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:52,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {2280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2159#false} is VALID [2022-02-20 17:14:52,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {2159#false} assume !false; {2159#false} is VALID [2022-02-20 17:14:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:14:52,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:52,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {2159#false} assume !false; {2159#false} is VALID [2022-02-20 17:14:52,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {2280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2159#false} is VALID [2022-02-20 17:14:52,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:52,420 INFO L272 TraceCheckUtils]: 37: Hoare triple {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:52,420 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2158#true} {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} #48#return; {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:14:52,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,421 INFO L272 TraceCheckUtils]: 32: Hoare triple {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:14:52,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:14:52,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {2296#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:14:52,426 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2158#true} {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #56#return; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,426 INFO L272 TraceCheckUtils]: 24: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,427 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2158#true} {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #54#return; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,427 INFO L272 TraceCheckUtils]: 19: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,428 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2158#true} {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #52#return; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,429 INFO L272 TraceCheckUtils]: 14: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,429 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2158#true} {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #50#return; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,430 INFO L272 TraceCheckUtils]: 9: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,430 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2158#true} {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} #48#return; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {2158#true} assume true; {2158#true} is VALID [2022-02-20 17:14:52,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {2158#true} assume !(0 == ~cond); {2158#true} is VALID [2022-02-20 17:14:52,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {2158#true} ~cond := #in~cond; {2158#true} is VALID [2022-02-20 17:14:52,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2158#true} is VALID [2022-02-20 17:14:52,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {2158#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2321#(= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:52,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {2158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2158#true} is VALID [2022-02-20 17:14:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:14:52,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:52,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700541484] [2022-02-20 17:14:52,433 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:52,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145665812] [2022-02-20 17:14:52,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145665812] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:52,434 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:52,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:14:52,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389315441] [2022-02-20 17:14:52,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:52,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-02-20 17:14:52,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:52,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:14:52,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:52,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:14:52,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:14:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:14:52,477 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:14:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:53,082 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2022-02-20 17:14:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:14:53,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-02-20 17:14:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:14:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:14:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:53,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-02-20 17:14:53,167 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:14:53,169 INFO L225 Difference]: With dead ends: 114 [2022-02-20 17:14:53,170 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 17:14:53,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:14:53,170 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:53,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:14:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 17:14:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-02-20 17:14:53,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:53,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:53,208 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:53,209 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:53,212 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-02-20 17:14:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-02-20 17:14:53,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:53,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:53,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 112 states. [2022-02-20 17:14:53,213 INFO L87 Difference]: Start difference. First operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 112 states. [2022-02-20 17:14:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:53,216 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2022-02-20 17:14:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-02-20 17:14:53,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:53,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:53,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:53,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-02-20 17:14:53,220 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2022-02-20 17:14:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:53,221 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-02-20 17:14:53,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:14:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-02-20 17:14:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:14:53,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:53,221 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:53,239 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:14:53,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:53,439 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 2 times [2022-02-20 17:14:53,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:53,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963756455] [2022-02-20 17:14:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:53,449 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:53,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528567206] [2022-02-20 17:14:53,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:14:53,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:53,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:53,450 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:14:53,451 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:14:53,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:14:53,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:14:53,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:14:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:53,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:53,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {2978#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2978#true} is VALID [2022-02-20 17:14:53,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {2978#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,668 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2978#true} {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #48#return; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,668 INFO L272 TraceCheckUtils]: 9: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,669 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2978#true} {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #50#return; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,675 INFO L272 TraceCheckUtils]: 14: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,676 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2978#true} {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #52#return; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,676 INFO L272 TraceCheckUtils]: 19: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,677 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2978#true} {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,677 INFO L272 TraceCheckUtils]: 24: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,679 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2978#true} {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #56#return; {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:53,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {2986#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:53,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:53,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:53,680 INFO L272 TraceCheckUtils]: 32: Hoare triple {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,681 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2978#true} {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} #48#return; {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:53,682 INFO L272 TraceCheckUtils]: 37: Hoare triple {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,683 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2978#true} {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} #50#return; {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:53,683 INFO L272 TraceCheckUtils]: 42: Hoare triple {3071#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:53,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:53,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2979#false} is VALID [2022-02-20 17:14:53,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {2979#false} assume !false; {2979#false} is VALID [2022-02-20 17:14:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:14:53,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:53,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {2979#false} assume !false; {2979#false} is VALID [2022-02-20 17:14:53,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2979#false} is VALID [2022-02-20 17:14:53,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:53,861 INFO L272 TraceCheckUtils]: 42: Hoare triple {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:53,861 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2978#true} {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} #50#return; {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:14:53,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,862 INFO L272 TraceCheckUtils]: 37: Hoare triple {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,862 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2978#true} {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} #48#return; {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:14:53,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,863 INFO L272 TraceCheckUtils]: 32: Hoare triple {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:14:53,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:14:53,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {3131#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:14:53,866 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2978#true} {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #56#return; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,866 INFO L272 TraceCheckUtils]: 24: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,871 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2978#true} {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #54#return; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,872 INFO L272 TraceCheckUtils]: 19: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,872 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2978#true} {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #52#return; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,872 INFO L272 TraceCheckUtils]: 14: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,873 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2978#true} {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #50#return; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,874 INFO L272 TraceCheckUtils]: 9: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,874 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2978#true} {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} #48#return; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {2978#true} assume true; {2978#true} is VALID [2022-02-20 17:14:53,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {2978#true} assume !(0 == ~cond); {2978#true} is VALID [2022-02-20 17:14:53,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {2978#true} ~cond := #in~cond; {2978#true} is VALID [2022-02-20 17:14:53,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {2978#true} is VALID [2022-02-20 17:14:53,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {2978#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {3171#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)))} is VALID [2022-02-20 17:14:53,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {2978#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2978#true} is VALID [2022-02-20 17:14:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:14:53,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:53,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963756455] [2022-02-20 17:14:53,878 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:53,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528567206] [2022-02-20 17:14:53,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528567206] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:53,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:53,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:14:53,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89828837] [2022-02-20 17:14:53,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-02-20 17:14:53,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:53,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:14:53,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:53,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:14:53,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:53,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:14:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:14:53,921 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:14:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:54,238 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2022-02-20 17:14:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:14:54,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-02-20 17:14:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:14:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 17:14:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:14:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 17:14:54,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-02-20 17:14:54,294 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:14:54,296 INFO L225 Difference]: With dead ends: 118 [2022-02-20 17:14:54,296 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 17:14:54,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:14:54,297 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:54,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 205 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:14:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 17:14:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-20 17:14:54,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:54,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:54,336 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:54,336 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:54,339 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-02-20 17:14:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-02-20 17:14:54,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:54,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:54,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 116 states. [2022-02-20 17:14:54,340 INFO L87 Difference]: Start difference. First operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand 116 states. [2022-02-20 17:14:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:54,343 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-02-20 17:14:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-02-20 17:14:54,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:54,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:54,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:54,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 17:14:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-02-20 17:14:54,346 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 46 [2022-02-20 17:14:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:54,346 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-02-20 17:14:54,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-20 17:14:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-02-20 17:14:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 17:14:54,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:54,347 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:54,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 17:14:54,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:54,551 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 3 times [2022-02-20 17:14:54,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:54,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580549643] [2022-02-20 17:14:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:54,560 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:54,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520188528] [2022-02-20 17:14:54,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:14:54,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:54,561 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:14:54,562 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:14:54,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 17:14:54,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:14:54,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:14:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:54,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:54,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {3842#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3842#true} is VALID [2022-02-20 17:14:54,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {3842#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,831 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3842#true} {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #48#return; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,831 INFO L272 TraceCheckUtils]: 9: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,832 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3842#true} {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #50#return; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,832 INFO L272 TraceCheckUtils]: 14: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,833 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3842#true} {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #52#return; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,833 INFO L272 TraceCheckUtils]: 19: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,834 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3842#true} {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,834 INFO L272 TraceCheckUtils]: 24: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,835 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3842#true} {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:54,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {3850#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:14:54,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:14:54,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:14:54,837 INFO L272 TraceCheckUtils]: 32: Hoare triple {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,838 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3842#true} {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} #48#return; {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:14:54,839 INFO L272 TraceCheckUtils]: 37: Hoare triple {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,847 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3842#true} {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} #50#return; {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:14:54,848 INFO L272 TraceCheckUtils]: 42: Hoare triple {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:54,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:54,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:54,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:54,848 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3842#true} {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} #52#return; {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:14:54,849 INFO L272 TraceCheckUtils]: 47: Hoare triple {3935#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= (+ 6 |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~y~0#1| (+ 6 |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3990#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:54,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {3990#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3994#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:54,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {3994#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3843#false} is VALID [2022-02-20 17:14:54,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {3843#false} assume !false; {3843#false} is VALID [2022-02-20 17:14:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:14:54,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:55,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {3843#false} assume !false; {3843#false} is VALID [2022-02-20 17:14:55,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {3994#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3843#false} is VALID [2022-02-20 17:14:55,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {3990#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3994#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:55,105 INFO L272 TraceCheckUtils]: 47: Hoare triple {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3990#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:55,106 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3842#true} {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #52#return; {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:14:55,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,106 INFO L272 TraceCheckUtils]: 42: Hoare triple {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,107 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3842#true} {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #50#return; {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:14:55,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,107 INFO L272 TraceCheckUtils]: 37: Hoare triple {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,108 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3842#true} {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} #48#return; {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:14:55,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,108 INFO L272 TraceCheckUtils]: 32: Hoare triple {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:14:55,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:14:55,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4010#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))} is VALID [2022-02-20 17:14:55,112 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3842#true} {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #56#return; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,113 INFO L272 TraceCheckUtils]: 24: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,113 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3842#true} {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #54#return; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,114 INFO L272 TraceCheckUtils]: 19: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,114 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3842#true} {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #52#return; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,115 INFO L272 TraceCheckUtils]: 14: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,115 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3842#true} {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #50#return; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,116 INFO L272 TraceCheckUtils]: 9: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,116 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3842#true} {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} #48#return; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {3842#true} assume true; {3842#true} is VALID [2022-02-20 17:14:55,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {3842#true} assume !(0 == ~cond); {3842#true} is VALID [2022-02-20 17:14:55,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {3842#true} ~cond := #in~cond; {3842#true} is VALID [2022-02-20 17:14:55,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {3842#true} is VALID [2022-02-20 17:14:55,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {3842#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {4065#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24)))} is VALID [2022-02-20 17:14:55,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {3842#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3842#true} is VALID [2022-02-20 17:14:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:14:55,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:55,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580549643] [2022-02-20 17:14:55,119 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:55,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520188528] [2022-02-20 17:14:55,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520188528] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:55,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:55,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:14:55,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808754329] [2022-02-20 17:14:55,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:55,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-02-20 17:14:55,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:55,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:14:55,178 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:14:55,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:14:55,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:55,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:14:55,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:14:55,179 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:14:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:56,277 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2022-02-20 17:14:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:14:56,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-02-20 17:14:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:14:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:14:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:56,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-02-20 17:14:56,373 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:14:56,374 INFO L225 Difference]: With dead ends: 142 [2022-02-20 17:14:56,375 INFO L226 Difference]: Without dead ends: 131 [2022-02-20 17:14:56,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:14:56,375 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:56,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 168 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 17:14:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-20 17:14:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-02-20 17:14:56,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:56,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:14:56,409 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:14:56,409 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:14:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:56,411 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-02-20 17:14:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-02-20 17:14:56,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:56,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:56,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-02-20 17:14:56,412 INFO L87 Difference]: Start difference. First operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-02-20 17:14:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:56,414 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-02-20 17:14:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-02-20 17:14:56,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:56,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:56,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:56,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:14:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-02-20 17:14:56,417 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 51 [2022-02-20 17:14:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:56,417 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-02-20 17:14:56,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:14:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-02-20 17:14:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:14:56,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:56,418 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:56,441 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:14:56,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:56,634 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2022-02-20 17:14:56,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:56,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987185865] [2022-02-20 17:14:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:56,647 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:56,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572101439] [2022-02-20 17:14:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:56,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:56,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:56,653 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:14:56,657 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:14:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:56,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 17:14:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:56,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:00,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {4810#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4810#true} is VALID [2022-02-20 17:15:00,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {4810#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,643 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4810#true} {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} #48#return; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,643 INFO L272 TraceCheckUtils]: 9: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,643 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4810#true} {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} #50#return; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,643 INFO L272 TraceCheckUtils]: 14: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,644 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4810#true} {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} #52#return; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,644 INFO L272 TraceCheckUtils]: 19: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,645 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4810#true} {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} #54#return; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,645 INFO L272 TraceCheckUtils]: 24: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,646 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4810#true} {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} #56#return; {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} is VALID [2022-02-20 17:15:00,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {4818#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|) (or (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< (div (+ |ULTIMATE.start_main_~a~0#1| 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536) 1)) (< |ULTIMATE.start_main_~a~0#1| 0)) (and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (<= 0 |ULTIMATE.start_main_~a~0#1|))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,648 INFO L272 TraceCheckUtils]: 32: Hoare triple {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,649 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4810#true} {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #48#return; {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,649 INFO L272 TraceCheckUtils]: 37: Hoare triple {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,649 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4810#true} {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #50#return; {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,649 INFO L272 TraceCheckUtils]: 42: Hoare triple {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,655 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4810#true} {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #52#return; {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,655 INFO L272 TraceCheckUtils]: 47: Hoare triple {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {4810#true} ~cond := #in~cond; {4961#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:00,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {4961#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4965#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:00,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {4965#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4965#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:00,657 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4965#(not (= |__VERIFIER_assert_#in~cond| 0))} {4903#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (<= (+ 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #54#return; {4972#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,658 INFO L272 TraceCheckUtils]: 52: Hoare triple {4972#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,659 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4810#true} {4972#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} #56#return; {4972#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:15:00,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {4972#(and (< |ULTIMATE.start_main_~a~0#1| 65536) (<= (div |ULTIMATE.start_main_~a~0#1| (- 65536)) (div (+ 32767 (* (- 1) |ULTIMATE.start_main_~a~0#1|)) 65536)) (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~n~0#1 <= main_~a~0#1); {4991#(and (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:00,660 INFO L272 TraceCheckUtils]: 58: Hoare triple {4991#(and (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {4810#true} is VALID [2022-02-20 17:15:00,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {4810#true} ~cond := #in~cond; {4810#true} is VALID [2022-02-20 17:15:00,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {4810#true} assume !(0 == ~cond); {4810#true} is VALID [2022-02-20 17:15:00,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-02-20 17:15:00,660 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {4810#true} {4991#(and (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #58#return; {4991#(and (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:00,661 INFO L272 TraceCheckUtils]: 63: Hoare triple {4991#(and (= (* 9 |ULTIMATE.start_main_~z~0#1|) (+ 90 (* |ULTIMATE.start_main_~x~0#1| 18))) (= |ULTIMATE.start_main_~x~0#1| 1) (< |ULTIMATE.start_main_~a~0#1| 1) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {5010#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:00,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {5010#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5014#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:00,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {5014#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4811#false} is VALID [2022-02-20 17:15:00,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {4811#false} assume !false; {4811#false} is VALID [2022-02-20 17:15:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-20 17:15:00,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:13,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:13,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987185865] [2022-02-20 17:15:13,186 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:13,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572101439] [2022-02-20 17:15:13,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572101439] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:13,186 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:13,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:15:13,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514154530] [2022-02-20 17:15:13,186 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:13,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 67 [2022-02-20 17:15:13,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:13,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:13,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:13,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:15:13,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:13,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:15:13,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:15:13,232 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:14,148 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-02-20 17:15:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:15:14,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 67 [2022-02-20 17:15:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-02-20 17:15:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-02-20 17:15:14,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-02-20 17:15:14,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:14,223 INFO L225 Difference]: With dead ends: 133 [2022-02-20 17:15:14,223 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 17:15:14,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:15:14,224 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:14,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 146 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:15:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 17:15:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-02-20 17:15:14,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:14,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:14,297 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:14,297 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:14,300 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2022-02-20 17:15:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-02-20 17:15:14,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:14,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:14,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 124 states. [2022-02-20 17:15:14,301 INFO L87 Difference]: Start difference. First operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 124 states. [2022-02-20 17:15:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:14,303 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2022-02-20 17:15:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-02-20 17:15:14,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:14,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:14,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:14,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-02-20 17:15:14,306 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 67 [2022-02-20 17:15:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:14,306 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-02-20 17:15:14,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-02-20 17:15:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-02-20 17:15:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 17:15:14,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:14,307 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-02-20 17:15:14,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:14,522 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,SelfDestructingSolverStorable10 [2022-02-20 17:15:14,523 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash -207258189, now seen corresponding path program 4 times [2022-02-20 17:15:14,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:14,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634925736] [2022-02-20 17:15:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:14,532 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:14,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972748260] [2022-02-20 17:15:14,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:15:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:14,545 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:15:14,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:15:15,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:15:15,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:15,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-20 17:15:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 17:15:17,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:18,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {5761#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5761#true} is VALID [2022-02-20 17:15:18,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {5761#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {5761#true} is VALID [2022-02-20 17:15:18,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {5761#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5761#true} is VALID [2022-02-20 17:15:18,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {5761#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {5761#true} is VALID [2022-02-20 17:15:18,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {5761#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:18,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:18,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:18,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:18,385 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5761#true} {5761#true} #48#return; {5761#true} is VALID [2022-02-20 17:15:18,385 INFO L272 TraceCheckUtils]: 9: Hoare triple {5761#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:18,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:18,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:18,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:18,386 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5761#true} #50#return; {5807#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} is VALID [2022-02-20 17:15:18,387 INFO L272 TraceCheckUtils]: 14: Hoare triple {5807#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:18,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:18,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:18,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:18,388 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5807#(= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))} #52#return; {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} is VALID [2022-02-20 17:15:18,388 INFO L272 TraceCheckUtils]: 19: Hoare triple {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:18,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:18,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:18,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:18,390 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} #54#return; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:18,390 INFO L272 TraceCheckUtils]: 24: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:18,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:18,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:18,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:18,391 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5761#true} {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} #56#return; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,696 INFO L272 TraceCheckUtils]: 32: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:19,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:19,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,697 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} #48#return; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,697 INFO L272 TraceCheckUtils]: 37: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:19,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:19,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,699 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} #50#return; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,699 INFO L272 TraceCheckUtils]: 42: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:19,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:19,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,700 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} #52#return; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,700 INFO L272 TraceCheckUtils]: 47: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:19,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:19,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,701 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} #54#return; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,701 INFO L272 TraceCheckUtils]: 52: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:19,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:19,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:19,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:19,702 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5761#true} {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} #56#return; {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} is VALID [2022-02-20 17:15:19,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {5839#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} is VALID [2022-02-20 17:15:19,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} is VALID [2022-02-20 17:15:19,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} is VALID [2022-02-20 17:15:19,804 INFO L272 TraceCheckUtils]: 60: Hoare triple {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:19,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:19,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:19,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:19,805 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5761#true} {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} #48#return; {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} is VALID [2022-02-20 17:15:19,805 INFO L272 TraceCheckUtils]: 65: Hoare triple {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:19,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {5761#true} ~cond := #in~cond; {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:19,806 INFO L290 TraceCheckUtils]: 67: Hoare triple {5796#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:19,806 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5823#(and (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)))} #50#return; {5978#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:19,807 INFO L272 TraceCheckUtils]: 70: Hoare triple {5978#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:19,807 INFO L290 TraceCheckUtils]: 71: Hoare triple {5982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:19,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {5986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5762#false} is VALID [2022-02-20 17:15:19,808 INFO L290 TraceCheckUtils]: 73: Hoare triple {5762#false} assume !false; {5762#false} is VALID [2022-02-20 17:15:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 71 proven. 65 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-02-20 17:15:19,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:21,505 INFO L290 TraceCheckUtils]: 73: Hoare triple {5762#false} assume !false; {5762#false} is VALID [2022-02-20 17:15:21,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {5986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5762#false} is VALID [2022-02-20 17:15:21,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {5982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:21,507 INFO L272 TraceCheckUtils]: 70: Hoare triple {5978#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:21,507 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #50#return; {5978#(= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:15:21,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {5761#true} ~cond := #in~cond; {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:21,508 INFO L272 TraceCheckUtils]: 65: Hoare triple {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,509 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5761#true} {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} #48#return; {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:21,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,509 INFO L272 TraceCheckUtils]: 60: Hoare triple {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:21,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:21,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {6043#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {6005#(or (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1))))} is VALID [2022-02-20 17:15:21,515 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5761#true} {6043#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} #56#return; {6043#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:21,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,516 INFO L272 TraceCheckUtils]: 52: Hoare triple {6043#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,517 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {6062#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))))} #54#return; {6043#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))))} is VALID [2022-02-20 17:15:21,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {5761#true} ~cond := #in~cond; {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:21,518 INFO L272 TraceCheckUtils]: 47: Hoare triple {6062#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,519 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {6078#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))) (not (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)))} #52#return; {6062#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))))} is VALID [2022-02-20 17:15:21,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {5761#true} ~cond := #in~cond; {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:21,520 INFO L272 TraceCheckUtils]: 42: Hoare triple {6078#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))) (not (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,521 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} {5761#true} #50#return; {6078#(or (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1))) (not (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* (* (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| 1)) 3) 4) (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (not (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)) (+ 6 (* |ULTIMATE.start_main_~y~0#1| 12) (* |ULTIMATE.start_main_~x~0#1| 18)))) (not (= (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:15:21,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:21,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {5761#true} ~cond := #in~cond; {6015#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:21,522 INFO L272 TraceCheckUtils]: 37: Hoare triple {5761#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,522 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5761#true} {5761#true} #48#return; {5761#true} is VALID [2022-02-20 17:15:21,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,522 INFO L272 TraceCheckUtils]: 32: Hoare triple {5761#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {5761#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {5761#true} is VALID [2022-02-20 17:15:21,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {5761#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5761#true} is VALID [2022-02-20 17:15:21,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {5761#true} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {5761#true} is VALID [2022-02-20 17:15:21,524 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5761#true} {5761#true} #56#return; {5761#true} is VALID [2022-02-20 17:15:21,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,525 INFO L272 TraceCheckUtils]: 24: Hoare triple {5761#true} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,525 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5761#true} {5761#true} #54#return; {5761#true} is VALID [2022-02-20 17:15:21,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,525 INFO L272 TraceCheckUtils]: 19: Hoare triple {5761#true} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,525 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5761#true} {5761#true} #52#return; {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L272 TraceCheckUtils]: 14: Hoare triple {5761#true} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5761#true} {5761#true} #50#return; {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,526 INFO L272 TraceCheckUtils]: 9: Hoare triple {5761#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5761#true} {5761#true} #48#return; {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {5761#true} assume true; {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {5761#true} assume !(0 == ~cond); {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {5761#true} ~cond := #in~cond; {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {5761#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {5761#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {5761#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5761#true} is VALID [2022-02-20 17:15:21,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {5761#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {5761#true} is VALID [2022-02-20 17:15:21,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {5761#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5761#true} is VALID [2022-02-20 17:15:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 23 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-02-20 17:15:21,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:21,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634925736] [2022-02-20 17:15:21,528 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:21,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972748260] [2022-02-20 17:15:21,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972748260] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:21,529 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:21,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2022-02-20 17:15:21,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245013506] [2022-02-20 17:15:21,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:21,530 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) Word has length 74 [2022-02-20 17:15:21,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:21,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2022-02-20 17:15:23,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 65 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:23,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:15:23,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:15:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:15:23,904 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2022-02-20 17:15:26,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:15:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:26,709 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-02-20 17:15:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:15:26,709 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) Word has length 74 [2022-02-20 17:15:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2022-02-20 17:15:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 17:15:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2022-02-20 17:15:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 17:15:26,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-02-20 17:15:27,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:27,094 INFO L225 Difference]: With dead ends: 134 [2022-02-20 17:15:27,094 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 17:15:27,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:15:27,095 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:27,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 17:15:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 17:15:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-02-20 17:15:27,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:27,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:15:27,162 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:15:27,162 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:15:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:27,165 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-02-20 17:15:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2022-02-20 17:15:27,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:27,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:27,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-02-20 17:15:27,166 INFO L87 Difference]: Start difference. First operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-02-20 17:15:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:27,168 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-02-20 17:15:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2022-02-20 17:15:27,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:27,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:27,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:27,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:15:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-02-20 17:15:27,170 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 74 [2022-02-20 17:15:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:27,171 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-02-20 17:15:27,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2022-02-20 17:15:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-02-20 17:15:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 17:15:27,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:27,172 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:27,178 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:15:27,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:27,378 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:27,378 INFO L85 PathProgramCache]: Analyzing trace with hash 308615369, now seen corresponding path program 2 times [2022-02-20 17:15:27,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:27,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82212410] [2022-02-20 17:15:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:27,388 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:27,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737515801] [2022-02-20 17:15:27,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:27,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:15:27,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 17:15:27,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:27,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:27,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 17:15:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:27,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:28,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {6847#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6847#true} is VALID [2022-02-20 17:15:28,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {6847#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,043 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6847#true} {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #48#return; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,043 INFO L272 TraceCheckUtils]: 9: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,043 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6847#true} {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #50#return; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,044 INFO L272 TraceCheckUtils]: 14: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,044 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6847#true} {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #52#return; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6847#true} {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,045 INFO L272 TraceCheckUtils]: 24: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,046 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6847#true} {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:28,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {6855#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,048 INFO L272 TraceCheckUtils]: 32: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,049 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6847#true} {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #48#return; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,049 INFO L272 TraceCheckUtils]: 37: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,050 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6847#true} {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #50#return; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,050 INFO L272 TraceCheckUtils]: 42: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,051 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6847#true} {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #52#return; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,051 INFO L272 TraceCheckUtils]: 47: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,052 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6847#true} {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #54#return; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,052 INFO L272 TraceCheckUtils]: 52: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,052 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6847#true} {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} #56#return; {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 17:15:28,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {6940#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)) 6) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~z~0#1| (+ 6 |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,054 INFO L272 TraceCheckUtils]: 60: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,054 INFO L290 TraceCheckUtils]: 62: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,055 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6847#true} {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} #48#return; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,055 INFO L272 TraceCheckUtils]: 65: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,056 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {6847#true} {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} #50#return; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,056 INFO L272 TraceCheckUtils]: 70: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,056 INFO L290 TraceCheckUtils]: 71: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,056 INFO L290 TraceCheckUtils]: 72: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,056 INFO L290 TraceCheckUtils]: 73: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,057 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6847#true} {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} #52#return; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,057 INFO L272 TraceCheckUtils]: 75: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,057 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6847#true} {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} #54#return; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,058 INFO L272 TraceCheckUtils]: 80: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,058 INFO L290 TraceCheckUtils]: 81: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,058 INFO L290 TraceCheckUtils]: 82: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,058 INFO L290 TraceCheckUtils]: 83: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,058 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6847#true} {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} #56#return; {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,059 INFO L290 TraceCheckUtils]: 85: Hoare triple {7025#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (= |ULTIMATE.start_main_~z~0#1| 18))} assume !(main_~n~0#1 <= main_~a~0#1); {7110#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (< |ULTIMATE.start_main_~a~0#1| 2) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,059 INFO L272 TraceCheckUtils]: 86: Hoare triple {7110#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (< |ULTIMATE.start_main_~a~0#1| 2) (= |ULTIMATE.start_main_~z~0#1| 18))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {6847#true} is VALID [2022-02-20 17:15:28,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {6847#true} ~cond := #in~cond; {6847#true} is VALID [2022-02-20 17:15:28,059 INFO L290 TraceCheckUtils]: 88: Hoare triple {6847#true} assume !(0 == ~cond); {6847#true} is VALID [2022-02-20 17:15:28,059 INFO L290 TraceCheckUtils]: 89: Hoare triple {6847#true} assume true; {6847#true} is VALID [2022-02-20 17:15:28,060 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {6847#true} {7110#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (< |ULTIMATE.start_main_~a~0#1| 2) (= |ULTIMATE.start_main_~z~0#1| 18))} #58#return; {7110#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (< |ULTIMATE.start_main_~a~0#1| 2) (= |ULTIMATE.start_main_~z~0#1| 18))} is VALID [2022-02-20 17:15:28,060 INFO L272 TraceCheckUtils]: 91: Hoare triple {7110#(and (<= 1 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~x~0#1| 8) (< |ULTIMATE.start_main_~a~0#1| 2) (= |ULTIMATE.start_main_~z~0#1| 18))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:28,061 INFO L290 TraceCheckUtils]: 92: Hoare triple {7129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:28,061 INFO L290 TraceCheckUtils]: 93: Hoare triple {7133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6848#false} is VALID [2022-02-20 17:15:28,061 INFO L290 TraceCheckUtils]: 94: Hoare triple {6848#false} assume !false; {6848#false} is VALID [2022-02-20 17:15:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-02-20 17:15:28,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:28,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:28,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82212410] [2022-02-20 17:15:28,393 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:28,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737515801] [2022-02-20 17:15:28,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737515801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:28,393 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:28,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:15:28,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852775135] [2022-02-20 17:15:28,393 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:28,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 95 [2022-02-20 17:15:28,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:28,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:28,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:28,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:28,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:28,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:28,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:15:28,439 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:28,940 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-02-20 17:15:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:15:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 95 [2022-02-20 17:15:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 17:15:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 17:15:28,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-02-20 17:15:29,013 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:15:29,015 INFO L225 Difference]: With dead ends: 134 [2022-02-20 17:15:29,015 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 17:15:29,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 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:15:29,016 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:29,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 249 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 17:15:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-02-20 17:15:29,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:29,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:29,081 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:29,081 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:29,083 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2022-02-20 17:15:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2022-02-20 17:15:29,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:29,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:29,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 132 states. [2022-02-20 17:15:29,084 INFO L87 Difference]: Start difference. First operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 132 states. [2022-02-20 17:15:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:29,086 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2022-02-20 17:15:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2022-02-20 17:15:29,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:29,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:29,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:29,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-02-20 17:15:29,089 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 95 [2022-02-20 17:15:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:29,089 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-02-20 17:15:29,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:15:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-02-20 17:15:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 17:15:29,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:29,091 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:29,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:29,307 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,SelfDestructingSolverStorable12 [2022-02-20 17:15:29,307 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash 75049244, now seen corresponding path program 1 times [2022-02-20 17:15:29,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:29,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703191114] [2022-02-20 17:15:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:29,317 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:29,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199134408] [2022-02-20 17:15:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:29,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:29,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:29,323 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:15:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 17:15:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:29,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 17:15:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:29,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:29,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {7897#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7897#true} is VALID [2022-02-20 17:15:29,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {7897#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,913 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7897#true} {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #48#return; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,913 INFO L272 TraceCheckUtils]: 9: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,913 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7897#true} {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #50#return; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,913 INFO L272 TraceCheckUtils]: 14: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,914 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7897#true} {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #52#return; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,914 INFO L272 TraceCheckUtils]: 19: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,915 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7897#true} {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,915 INFO L272 TraceCheckUtils]: 24: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,916 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7897#true} {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:15:29,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {7905#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,917 INFO L272 TraceCheckUtils]: 32: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,918 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7897#true} {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} #48#return; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,918 INFO L272 TraceCheckUtils]: 37: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,919 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7897#true} {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} #50#return; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,919 INFO L272 TraceCheckUtils]: 42: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,919 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7897#true} {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} #52#return; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,919 INFO L272 TraceCheckUtils]: 47: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,920 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7897#true} {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} #54#return; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,920 INFO L272 TraceCheckUtils]: 52: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,921 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7897#true} {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} #56#return; {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} is VALID [2022-02-20 17:15:29,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {7990#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= (+ |ULTIMATE.start_main_~z~0#1| (- 5)) |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (- 6)) 6))} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,922 INFO L272 TraceCheckUtils]: 60: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,923 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7897#true} {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} #48#return; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,923 INFO L272 TraceCheckUtils]: 65: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,924 INFO L290 TraceCheckUtils]: 68: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,924 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7897#true} {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} #50#return; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,924 INFO L272 TraceCheckUtils]: 70: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,925 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7897#true} {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} #52#return; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,925 INFO L272 TraceCheckUtils]: 75: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,926 INFO L290 TraceCheckUtils]: 77: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,926 INFO L290 TraceCheckUtils]: 78: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,926 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {7897#true} {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} #54#return; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,926 INFO L272 TraceCheckUtils]: 80: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,926 INFO L290 TraceCheckUtils]: 81: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,927 INFO L290 TraceCheckUtils]: 82: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,927 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7897#true} {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} #56#return; {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:15:29,928 INFO L290 TraceCheckUtils]: 85: Hoare triple {8075#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~n~0#1 <= main_~a~0#1); {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} is VALID [2022-02-20 17:15:29,928 INFO L272 TraceCheckUtils]: 86: Hoare triple {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,928 INFO L290 TraceCheckUtils]: 87: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,929 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {7897#true} {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} #58#return; {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} is VALID [2022-02-20 17:15:29,929 INFO L272 TraceCheckUtils]: 91: Hoare triple {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {7897#true} is VALID [2022-02-20 17:15:29,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {7897#true} ~cond := #in~cond; {7897#true} is VALID [2022-02-20 17:15:29,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {7897#true} assume !(0 == ~cond); {7897#true} is VALID [2022-02-20 17:15:29,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {7897#true} assume true; {7897#true} is VALID [2022-02-20 17:15:29,930 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7897#true} {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} #60#return; {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} is VALID [2022-02-20 17:15:29,931 INFO L272 TraceCheckUtils]: 96: Hoare triple {8160#(and (= 6 (+ |ULTIMATE.start_main_~z~0#1| (- 12))) (= (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|) (+ (- 11) |ULTIMATE.start_main_~z~0#1|)) (<= 1 |ULTIMATE.start_main_~a~0#1|) (< |ULTIMATE.start_main_~a~0#1| 2))} call __VERIFIER_assert((if 0 == main_~a~0#1 * main_~z~0#1 - 6 * main_~a~0#1 - 2 * main_~y~0#1 + 2 * main_~z~0#1 - 10 then 1 else 0)); {8194#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:29,931 INFO L290 TraceCheckUtils]: 97: Hoare triple {8194#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8198#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:29,931 INFO L290 TraceCheckUtils]: 98: Hoare triple {8198#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7898#false} is VALID [2022-02-20 17:15:29,932 INFO L290 TraceCheckUtils]: 99: Hoare triple {7898#false} assume !false; {7898#false} is VALID [2022-02-20 17:15:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-02-20 17:15:29,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:41,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:41,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703191114] [2022-02-20 17:15:41,422 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:41,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199134408] [2022-02-20 17:15:41,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199134408] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:41,423 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:41,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:15:41,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598255092] [2022-02-20 17:15:41,423 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 100 [2022-02-20 17:15:41,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:41,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:41,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:41,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:15:41,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:41,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:15:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:15:41,470 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:41,946 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-02-20 17:15:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:15:41,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 100 [2022-02-20 17:15:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 17:15:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 17:15:41,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-02-20 17:15:42,015 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:15:42,017 INFO L225 Difference]: With dead ends: 138 [2022-02-20 17:15:42,017 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 17:15:42,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 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:15:42,018 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:42,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:15:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 17:15:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-02-20 17:15:42,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:42,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:42,081 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:42,081 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:42,082 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-02-20 17:15:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-02-20 17:15:42,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:42,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:42,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 125 states. [2022-02-20 17:15:42,083 INFO L87 Difference]: Start difference. First operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 125 states. [2022-02-20 17:15:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:42,085 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-02-20 17:15:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-02-20 17:15:42,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:42,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:42,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:42,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.0375) internal successors, (83), 81 states have internal predecessors, (83), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:15:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2022-02-20 17:15:42,087 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 100 [2022-02-20 17:15:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:42,088 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2022-02-20 17:15:42,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 17:15:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-02-20 17:15:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-20 17:15:42,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:42,089 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:42,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:42,305 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,SelfDestructingSolverStorable13 [2022-02-20 17:15:42,305 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1859389073, now seen corresponding path program 3 times [2022-02-20 17:15:42,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:42,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279568732] [2022-02-20 17:15:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:42,322 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:42,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256718496] [2022-02-20 17:15:42,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:15:42,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:42,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:42,325 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:15:42,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 17:15:42,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 17:15:42,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:15:42,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:15:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:42,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {8959#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {8959#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {8959#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {8959#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {8959#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8959#true} {8959#true} #48#return; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L272 TraceCheckUtils]: 9: Hoare triple {8959#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8959#true} {8959#true} #50#return; {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L272 TraceCheckUtils]: 14: Hoare triple {8959#true} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8959#true} {8959#true} #52#return; {8959#true} is VALID [2022-02-20 17:15:43,647 INFO L272 TraceCheckUtils]: 19: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8959#true} {8959#true} #54#return; {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L272 TraceCheckUtils]: 24: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8959#true} {8959#true} #56#return; {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {8959#true} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {8959#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {8959#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L272 TraceCheckUtils]: 32: Hoare triple {8959#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,649 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8959#true} {8959#true} #48#return; {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L272 TraceCheckUtils]: 37: Hoare triple {8959#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8959#true} {8959#true} #50#return; {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L272 TraceCheckUtils]: 42: Hoare triple {8959#true} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8959#true} {8959#true} #52#return; {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L272 TraceCheckUtils]: 47: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L290 TraceCheckUtils]: 50: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8959#true} {8959#true} #54#return; {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L272 TraceCheckUtils]: 52: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L290 TraceCheckUtils]: 54: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L290 TraceCheckUtils]: 55: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8959#true} {8959#true} #56#return; {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {8959#true} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {8959#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {8959#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L272 TraceCheckUtils]: 60: Hoare triple {8959#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L290 TraceCheckUtils]: 62: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8959#true} {8959#true} #48#return; {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L272 TraceCheckUtils]: 65: Hoare triple {8959#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L290 TraceCheckUtils]: 67: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8959#true} {8959#true} #50#return; {8959#true} is VALID [2022-02-20 17:15:43,653 INFO L272 TraceCheckUtils]: 70: Hoare triple {8959#true} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L290 TraceCheckUtils]: 71: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L290 TraceCheckUtils]: 73: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8959#true} {8959#true} #52#return; {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L272 TraceCheckUtils]: 75: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L290 TraceCheckUtils]: 76: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L290 TraceCheckUtils]: 77: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,654 INFO L290 TraceCheckUtils]: 78: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,655 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {8959#true} {8959#true} #54#return; {8959#true} is VALID [2022-02-20 17:15:43,655 INFO L272 TraceCheckUtils]: 80: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,655 INFO L290 TraceCheckUtils]: 81: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,655 INFO L290 TraceCheckUtils]: 82: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,655 INFO L290 TraceCheckUtils]: 83: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,655 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8959#true} {8959#true} #56#return; {8959#true} is VALID [2022-02-20 17:15:43,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {8959#true} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {9219#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:15:43,656 INFO L290 TraceCheckUtils]: 86: Hoare triple {9219#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9219#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:15:43,657 INFO L290 TraceCheckUtils]: 87: Hoare triple {9219#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {9219#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:15:43,657 INFO L272 TraceCheckUtils]: 88: Hoare triple {9219#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,657 INFO L290 TraceCheckUtils]: 89: Hoare triple {8959#true} ~cond := #in~cond; {9232#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:43,657 INFO L290 TraceCheckUtils]: 90: Hoare triple {9232#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:43,658 INFO L290 TraceCheckUtils]: 91: Hoare triple {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:43,658 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} {9219#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1))} #48#return; {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:43,658 INFO L272 TraceCheckUtils]: 93: Hoare triple {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,658 INFO L290 TraceCheckUtils]: 94: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,658 INFO L290 TraceCheckUtils]: 95: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,659 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {8959#true} {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} #50#return; {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:43,659 INFO L272 TraceCheckUtils]: 98: Hoare triple {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,659 INFO L290 TraceCheckUtils]: 99: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,659 INFO L290 TraceCheckUtils]: 100: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,659 INFO L290 TraceCheckUtils]: 101: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,660 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {8959#true} {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} #52#return; {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:43,660 INFO L272 TraceCheckUtils]: 103: Hoare triple {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,660 INFO L290 TraceCheckUtils]: 104: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,660 INFO L290 TraceCheckUtils]: 105: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,660 INFO L290 TraceCheckUtils]: 106: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,661 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {8959#true} {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} #54#return; {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:43,661 INFO L272 TraceCheckUtils]: 108: Hoare triple {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,661 INFO L290 TraceCheckUtils]: 109: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,661 INFO L290 TraceCheckUtils]: 111: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,662 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {8959#true} {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} #56#return; {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:43,663 INFO L290 TraceCheckUtils]: 113: Hoare triple {9243#(and (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)))} assume !(main_~n~0#1 <= main_~a~0#1); {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} is VALID [2022-02-20 17:15:43,663 INFO L272 TraceCheckUtils]: 114: Hoare triple {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:43,663 INFO L290 TraceCheckUtils]: 115: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:43,663 INFO L290 TraceCheckUtils]: 116: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:43,663 INFO L290 TraceCheckUtils]: 117: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:43,664 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {8959#true} {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} #58#return; {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} is VALID [2022-02-20 17:15:43,794 INFO L272 TraceCheckUtils]: 119: Hoare triple {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:43,794 INFO L290 TraceCheckUtils]: 120: Hoare triple {9326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:43,795 INFO L290 TraceCheckUtils]: 121: Hoare triple {9330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8960#false} is VALID [2022-02-20 17:15:43,795 INFO L290 TraceCheckUtils]: 122: Hoare triple {8960#false} assume !false; {8960#false} is VALID [2022-02-20 17:15:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-02-20 17:15:43,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:45,523 INFO L290 TraceCheckUtils]: 122: Hoare triple {8960#false} assume !false; {8960#false} is VALID [2022-02-20 17:15:45,524 INFO L290 TraceCheckUtils]: 121: Hoare triple {9330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8960#false} is VALID [2022-02-20 17:15:45,524 INFO L290 TraceCheckUtils]: 120: Hoare triple {9326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:15:45,950 INFO L272 TraceCheckUtils]: 119: Hoare triple {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} call __VERIFIER_assert((if 0 == 6 * main_~a~0#1 * main_~x~0#1 - main_~x~0#1 * main_~z~0#1 + 12 * main_~x~0#1 then 1 else 0)); {9326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:45,951 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {8959#true} {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} #58#return; {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} is VALID [2022-02-20 17:15:45,951 INFO L290 TraceCheckUtils]: 117: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,951 INFO L290 TraceCheckUtils]: 116: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,951 INFO L290 TraceCheckUtils]: 115: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,951 INFO L272 TraceCheckUtils]: 114: Hoare triple {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,952 INFO L290 TraceCheckUtils]: 113: Hoare triple {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} assume !(main_~n~0#1 <= main_~a~0#1); {9307#(and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0))} is VALID [2022-02-20 17:15:45,953 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {8959#true} {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} #56#return; {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} is VALID [2022-02-20 17:15:45,953 INFO L290 TraceCheckUtils]: 111: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,953 INFO L290 TraceCheckUtils]: 110: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,953 INFO L290 TraceCheckUtils]: 109: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,953 INFO L272 TraceCheckUtils]: 108: Hoare triple {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,953 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {8959#true} {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} #54#return; {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} is VALID [2022-02-20 17:15:45,954 INFO L290 TraceCheckUtils]: 106: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,954 INFO L290 TraceCheckUtils]: 105: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,954 INFO L290 TraceCheckUtils]: 104: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,954 INFO L272 TraceCheckUtils]: 103: Hoare triple {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,954 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {8959#true} {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} #52#return; {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} is VALID [2022-02-20 17:15:45,954 INFO L290 TraceCheckUtils]: 101: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,954 INFO L290 TraceCheckUtils]: 100: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,954 INFO L290 TraceCheckUtils]: 99: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,954 INFO L272 TraceCheckUtils]: 98: Hoare triple {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,955 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {8959#true} {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} #50#return; {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} is VALID [2022-02-20 17:15:45,955 INFO L290 TraceCheckUtils]: 96: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,955 INFO L290 TraceCheckUtils]: 95: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,955 INFO L272 TraceCheckUtils]: 93: Hoare triple {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,957 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} {9428#(or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)))} #48#return; {9364#(or (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|) (and (not (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) |ULTIMATE.start_main_~a~0#1|)) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)) (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)))} is VALID [2022-02-20 17:15:45,957 INFO L290 TraceCheckUtils]: 91: Hoare triple {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:45,957 INFO L290 TraceCheckUtils]: 90: Hoare triple {9438#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9236#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:15:45,957 INFO L290 TraceCheckUtils]: 89: Hoare triple {8959#true} ~cond := #in~cond; {9438#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:15:45,958 INFO L272 TraceCheckUtils]: 88: Hoare triple {9428#(or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,958 INFO L290 TraceCheckUtils]: 87: Hoare triple {9428#(or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {9428#(or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:45,958 INFO L290 TraceCheckUtils]: 86: Hoare triple {9428#(or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {9428#(or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:45,959 INFO L290 TraceCheckUtils]: 85: Hoare triple {8959#true} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {9428#(or (not (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (<= (div (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6) (- 6)) (+ |ULTIMATE.start_main_~a~0#1| 1)))} is VALID [2022-02-20 17:15:45,959 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8959#true} {8959#true} #56#return; {8959#true} is VALID [2022-02-20 17:15:45,959 INFO L290 TraceCheckUtils]: 83: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,959 INFO L290 TraceCheckUtils]: 82: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,959 INFO L272 TraceCheckUtils]: 80: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,959 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {8959#true} {8959#true} #54#return; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 78: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 77: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 76: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L272 TraceCheckUtils]: 75: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8959#true} {8959#true} #52#return; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 71: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L272 TraceCheckUtils]: 70: Hoare triple {8959#true} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8959#true} {8959#true} #50#return; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 68: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 67: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L272 TraceCheckUtils]: 65: Hoare triple {8959#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8959#true} {8959#true} #48#return; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L272 TraceCheckUtils]: 60: Hoare triple {8959#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L290 TraceCheckUtils]: 59: Hoare triple {8959#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {8959#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {8959#true} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8959#true} {8959#true} #56#return; {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L290 TraceCheckUtils]: 55: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L272 TraceCheckUtils]: 52: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8959#true} {8959#true} #54#return; {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L272 TraceCheckUtils]: 47: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8959#true} {8959#true} #52#return; {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L272 TraceCheckUtils]: 42: Hoare triple {8959#true} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8959#true} {8959#true} #50#return; {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L272 TraceCheckUtils]: 37: Hoare triple {8959#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,963 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8959#true} {8959#true} #48#return; {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L272 TraceCheckUtils]: 32: Hoare triple {8959#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {8959#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {8959#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {8959#true} assume !!(main_~n~0#1 <= main_~a~0#1);main_~n~0#1 := 1 + main_~n~0#1;main_~x~0#1 := main_~x~0#1 + main_~y~0#1;main_~y~0#1 := main_~y~0#1 + main_~z~0#1;main_~z~0#1 := 6 + main_~z~0#1; {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8959#true} {8959#true} #56#return; {8959#true} is VALID [2022-02-20 17:15:45,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L272 TraceCheckUtils]: 24: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == 12 + (main_~z~0#1 * main_~z~0#1 - 12 * main_~y~0#1 - 6 * main_~z~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8959#true} {8959#true} #54#return; {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,965 INFO L272 TraceCheckUtils]: 19: Hoare triple {8959#true} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8959#true} {8959#true} #52#return; {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L272 TraceCheckUtils]: 14: Hoare triple {8959#true} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8959#true} {8959#true} #50#return; {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L272 TraceCheckUtils]: 9: Hoare triple {8959#true} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8959#true} {8959#true} #48#return; {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {8959#true} assume true; {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {8959#true} assume !(0 == ~cond); {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {8959#true} ~cond := #in~cond; {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {8959#true} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {8959#true} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:45,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {8959#true} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {8959#true} is VALID [2022-02-20 17:15:45,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {8959#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_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {8959#true} is VALID [2022-02-20 17:15:45,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {8959#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8959#true} is VALID [2022-02-20 17:15:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 110 proven. 16 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-02-20 17:15:45,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:45,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279568732] [2022-02-20 17:15:45,969 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:45,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256718496] [2022-02-20 17:15:45,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256718496] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:15:45,969 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:15:45,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 17:15:45,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788112178] [2022-02-20 17:15:45,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:45,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 123 [2022-02-20 17:15:45,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:45,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-02-20 17:15:48,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:48,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:15:48,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:48,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:15:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:15:48,045 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-02-20 17:15:57,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:15:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:57,126 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2022-02-20 17:15:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:15:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 123 [2022-02-20 17:15:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-02-20 17:15:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-02-20 17:15:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-02-20 17:15:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-02-20 17:15:57,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-02-20 17:15:59,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:59,134 INFO L225 Difference]: With dead ends: 134 [2022-02-20 17:15:59,135 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 17:15:59,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:15:59,135 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:59,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 125 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 17:15:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 17:15:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-02-20 17:15:59,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:59,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:59,224 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:59,225 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:59,226 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-02-20 17:15:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-02-20 17:15:59,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:59,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:59,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 132 states. [2022-02-20 17:15:59,227 INFO L87 Difference]: Start difference. First operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 132 states. [2022-02-20 17:15:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:59,229 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-02-20 17:15:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-02-20 17:15:59,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:59,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:59,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:59,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:15:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-02-20 17:15:59,232 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 123 [2022-02-20 17:15:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:59,232 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-02-20 17:15:59,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-02-20 17:15:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-02-20 17:15:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-20 17:15:59,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:59,234 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:59,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0