./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.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_unwindbound2.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 f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:14:39,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:14:39,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:14:39,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:14:39,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:14:39,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:14:39,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:14:39,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:14:39,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:14:39,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:14:39,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:14:39,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:14:39,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:14:39,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:14:39,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:14:39,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:14:39,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:14:39,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:14:39,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:14:39,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:14:39,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:14:39,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:14:39,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:14:39,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:14:39,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:14:39,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:14:39,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:14:39,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:14:39,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:14:39,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:14:39,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:14:39,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:14:39,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:14:39,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:14:39,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:14:39,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:14:39,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:14:39,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:14:39,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:14:39,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:14:39,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:14:39,266 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:39,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:14:39,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:14:39,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:14:39,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:14:39,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:14:39,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:14:39,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:14:39,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:14:39,297 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:14:39,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:14:39,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:14:39,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:14:39,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:14:39,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:14:39,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:14:39,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:14:39,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:14:39,305 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:14:39,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:14:39,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:14:39,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:14:39,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:14:39,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:14:39,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:14:39,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:39,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:14:39,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:14:39,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:14:39,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:14:39,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:14:39,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:14:39,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:14:39,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:14:39,310 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 -> f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 [2022-02-20 17:14:39,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:14:39,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:14:39,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:14:39,581 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:14:39,582 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:14:39,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-02-20 17:14:39,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d728d60/2c094950c7864a0c817f26c2662c83db/FLAG366a8c005 [2022-02-20 17:14:40,086 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:14:40,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-02-20 17:14:40,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d728d60/2c094950c7864a0c817f26c2662c83db/FLAG366a8c005 [2022-02-20 17:14:40,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d728d60/2c094950c7864a0c817f26c2662c83db [2022-02-20 17:14:40,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:14:40,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:14:40,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:40,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:14:40,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:14:40,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:40" (1/1) ... [2022-02-20 17:14:40,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98c9200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:40, skipping insertion in model container [2022-02-20 17:14:40,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:40" (1/1) ... [2022-02-20 17:14:40,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:14:40,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:14:40,638 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_unwindbound2.c[588,601] [2022-02-20 17:14:40,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:40,695 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:14:40,708 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_unwindbound2.c[588,601] [2022-02-20 17:14:40,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:40,748 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:14:40,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:40 WrapperNode [2022-02-20 17:14:40,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:40,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:40,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:14:40,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:14:40,757 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:40" (1/1) ... [2022-02-20 17:14:40,771 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:40" (1/1) ... [2022-02-20 17:14:40,801 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-02-20 17:14:40,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:40,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:14:40,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:14:40,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:14:40,809 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:40" (1/1) ... [2022-02-20 17:14:40,810 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:40" (1/1) ... [2022-02-20 17:14:40,812 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:40" (1/1) ... [2022-02-20 17:14:40,813 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:40" (1/1) ... [2022-02-20 17:14:40,825 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:40" (1/1) ... [2022-02-20 17:14:40,829 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:40" (1/1) ... [2022-02-20 17:14:40,835 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:40" (1/1) ... [2022-02-20 17:14:40,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:14:40,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:14:40,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:14:40,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:14:40,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:40" (1/1) ... [2022-02-20 17:14:40,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:40,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:40,868 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:40,883 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:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:14:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:14:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:14:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:14:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:14:40,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:14:40,966 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:14:40,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:14:41,123 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:14:41,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:14:41,133 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:14:41,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:41 BoogieIcfgContainer [2022-02-20 17:14:41,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:14:41,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:14:41,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:14:41,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:14:41,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:14:40" (1/3) ... [2022-02-20 17:14:41,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9a62e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:41, skipping insertion in model container [2022-02-20 17:14:41,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:40" (2/3) ... [2022-02-20 17:14:41,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9a62e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:41, skipping insertion in model container [2022-02-20 17:14:41,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:41" (3/3) ... [2022-02-20 17:14:41,144 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2022-02-20 17:14:41,148 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:14:41,148 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:14:41,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:14:41,194 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:41,195 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:14:41,211 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:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:14:41,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:41,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:41,215 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-02-20 17:14:41,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:41,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818850749] [2022-02-20 17:14:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:41,381 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:41,381 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:41,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 17:14:41,383 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:41,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:14:41,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:14:41,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:14:41,384 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:41,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:41,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818850749] [2022-02-20 17:14:41,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818850749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:41,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:41,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:14:41,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997668763] [2022-02-20 17:14:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:41,407 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:41,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:41,410 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:41,440 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:41,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:14:41,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:14:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:14:41,458 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:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:41,534 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-02-20 17:14:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:14:41,534 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:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:41,536 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:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:41,545 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:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:41,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:14:41,726 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:41,736 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:41,737 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:14:41,741 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:41,745 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:41,746 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:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:14:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:14:41,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:41,775 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:41,776 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:41,777 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:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:41,786 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:41,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:41,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:41,788 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:41,788 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:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:41,792 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:41,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:41,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:41,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:41,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:41,794 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:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-02-20 17:14:41,806 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-02-20 17:14:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:41,807 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-02-20 17:14:41,808 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:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:41,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:41,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:41,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:14:41,811 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:41,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-02-20 17:14:41,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:41,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037733539] [2022-02-20 17:14:41,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:41,903 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:41,904 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:41,904 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:41,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {191#false} is VALID [2022-02-20 17:14:41,905 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:41,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-02-20 17:14:41,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-02-20 17:14:41,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 17:14:41,906 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:41,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:41,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037733539] [2022-02-20 17:14:41,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037733539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:41,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:41,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:14:41,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004136541] [2022-02-20 17:14:41,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:41,909 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:41,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:41,909 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:41,916 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:41,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:14:41,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:14:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:14:41,918 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:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:42,034 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-20 17:14:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:14:42,034 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:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:42,034 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:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:42,036 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:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:42,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-02-20 17:14:42,094 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:42,096 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:14:42,096 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:14:42,099 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:42,102 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:42,103 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:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:14:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:14:42,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:42,108 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:42,108 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:42,108 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:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:42,110 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:42,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:42,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:42,112 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:42,113 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:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:42,115 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:42,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:42,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:42,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:42,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:42,119 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:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-02-20 17:14:42,121 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-02-20 17:14:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:42,121 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-02-20 17:14:42,122 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:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:42,122 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:42,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:42,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:14:42,123 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-02-20 17:14:42,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:42,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217212690] [2022-02-20 17:14:42,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:42,224 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:42,225 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:42,226 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:42,227 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 < 2);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:42,228 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:42,228 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:42,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {340#false} is VALID [2022-02-20 17:14:42,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-02-20 17:14:42,230 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:42,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:42,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217212690] [2022-02-20 17:14:42,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217212690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:42,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:42,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:42,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566544881] [2022-02-20 17:14:42,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:42,232 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:42,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:42,233 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:42,240 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:42,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:42,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:42,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:42,242 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:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:42,437 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 17:14:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:14:42,438 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:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:42,438 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:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:14:42,440 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:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:14:42,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 17:14:42,487 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:42,488 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:14:42,488 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:14:42,489 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:42,490 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:42,490 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:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:14:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:14:42,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:42,496 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:42,496 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:42,497 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:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:42,499 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-02-20 17:14:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:42,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:42,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:42,500 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:42,500 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:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:42,502 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-02-20 17:14:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:42,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:42,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:42,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:42,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:42,504 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:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-02-20 17:14:42,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2022-02-20 17:14:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:42,506 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-02-20 17:14:42,506 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:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:14:42,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:42,507 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:42,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:14:42,507 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-02-20 17:14:42,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:42,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228807635] [2022-02-20 17:14:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:42,521 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:42,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285562196] [2022-02-20 17:14:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:42,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:42,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:42,531 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:42,540 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:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:42,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:14:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:42,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:42,692 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:42,694 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:42,694 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:42,695 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 < 2);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:42,695 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:42,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} ~cond := #in~cond; {492#true} is VALID [2022-02-20 17:14:42,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {492#true} assume !(0 == ~cond); {492#true} is VALID [2022-02-20 17:14:42,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 17:14:42,697 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:42,698 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:42,699 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:42,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {493#false} is VALID [2022-02-20 17:14:42,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-20 17:14:42,701 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:42,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:42,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:42,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228807635] [2022-02-20 17:14:42,701 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:42,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285562196] [2022-02-20 17:14:42,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285562196] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:42,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:42,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:42,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573015461] [2022-02-20 17:14:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:42,704 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:42,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:42,704 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:42,716 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:42,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:42,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:42,719 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:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:43,025 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-02-20 17:14:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:43,026 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:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:43,026 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:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:43,027 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:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:43,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:43,100 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:43,102 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:14:43,102 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:14:43,102 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:43,103 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:43,103 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.1s Time] [2022-02-20 17:14:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:14:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-02-20 17:14:43,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:43,130 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:43,131 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:43,133 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:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:43,139 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:43,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:43,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:43,140 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:43,140 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:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:43,144 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:43,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:43,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:43,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:43,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:43,146 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:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 17:14:43,148 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2022-02-20 17:14:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:43,148 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 17:14:43,148 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:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 17:14:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:14:43,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:43,149 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:43,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:43,372 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:43,373 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-02-20 17:14:43,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:43,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647659299] [2022-02-20 17:14:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:43,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:43,386 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:43,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542088394] [2022-02-20 17:14:43,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:43,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:43,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:43,392 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:43,395 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:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:43,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:14:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:43,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:43,558 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:43,560 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:43,560 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:43,561 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 < 2);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:43,561 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:43,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {750#true} ~cond := #in~cond; {750#true} is VALID [2022-02-20 17:14:43,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {750#true} assume !(0 == ~cond); {750#true} is VALID [2022-02-20 17:14:43,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {750#true} assume true; {750#true} is VALID [2022-02-20 17:14:43,562 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:43,563 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:43,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {750#true} ~cond := #in~cond; {750#true} is VALID [2022-02-20 17:14:43,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {750#true} assume !(0 == ~cond); {750#true} is VALID [2022-02-20 17:14:43,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {750#true} assume true; {750#true} is VALID [2022-02-20 17:14:43,564 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:43,569 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:43,569 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:43,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {751#false} is VALID [2022-02-20 17:14:43,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {751#false} assume !false; {751#false} is VALID [2022-02-20 17:14:43,570 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:43,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:43,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:43,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647659299] [2022-02-20 17:14:43,571 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:43,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542088394] [2022-02-20 17:14:43,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542088394] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:43,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:43,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:43,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575384945] [2022-02-20 17:14:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:43,572 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:43,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:43,573 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:43,586 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:43,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:43,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:43,587 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:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:43,854 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-02-20 17:14:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:43,854 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:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:43,855 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:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:43,857 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:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:43,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:43,931 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:43,933 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:43,933 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:14:43,933 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:43,934 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:43,934 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:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:14:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:14:43,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:43,944 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:43,944 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:43,945 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:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:43,948 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:43,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:43,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:43,949 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:43,949 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:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:43,952 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:43,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:43,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:43,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:43,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:43,954 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:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 17:14:43,956 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-02-20 17:14:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:43,956 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 17:14:43,956 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:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 17:14:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:14:43,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:43,957 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:43,985 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:44,181 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:44,182 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-02-20 17:14:44,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:44,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134258101] [2022-02-20 17:14:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:44,193 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:44,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946380373] [2022-02-20 17:14:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:44,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:44,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:44,195 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:44,197 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:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:44,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:14:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:44,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:44,379 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:44,380 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:44,381 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:44,381 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 < 2);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:44,382 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:44,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:44,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:44,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:44,383 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:44,384 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:44,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:44,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:44,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:44,385 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:44,385 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:44,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:44,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:44,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:44,387 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:44,388 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:44,388 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:44,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1053#false} is VALID [2022-02-20 17:14:44,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2022-02-20 17:14:44,389 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:44,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:44,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:44,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134258101] [2022-02-20 17:14:44,390 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:44,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946380373] [2022-02-20 17:14:44,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946380373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:44,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:44,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:44,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138987542] [2022-02-20 17:14:44,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:44,392 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:44,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:44,392 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:44,408 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:44,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:44,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:44,410 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:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:44,695 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-02-20 17:14:44,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:44,695 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:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:44,696 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:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:44,698 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:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:44,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:44,768 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:44,770 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:14:44,770 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:14:44,770 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:44,771 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:44,771 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.1s Time] [2022-02-20 17:14:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:14:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:14:44,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:44,784 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:44,787 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:44,788 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:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:44,790 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:14:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:44,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:44,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:44,791 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:44,792 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:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:44,794 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:14:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:44,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:44,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:44,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:44,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:44,796 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:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-02-20 17:14:44,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-02-20 17:14:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:44,798 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-02-20 17:14:44,798 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:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:14:44,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:44,800 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:44,817 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:45,007 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:45,008 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2022-02-20 17:14:45,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:45,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655482776] [2022-02-20 17:14:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:45,020 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:45,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936439046] [2022-02-20 17:14:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:45,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:45,022 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:45,031 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:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:45,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:14:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:45,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:45,265 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:45,265 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:45,266 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:45,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {1388#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,267 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:45,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,269 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:45,270 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:45,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,272 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:45,272 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:45,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,274 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:45,275 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:45,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,277 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:45,277 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:45,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {1388#(<= ~counter~0 1)} ~cond := #in~cond; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {1388#(<= ~counter~0 1)} assume !(0 == ~cond); {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {1388#(<= ~counter~0 1)} assume true; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,282 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:45,282 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:45,283 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:45,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {1473#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1377#false} is VALID [2022-02-20 17:14:45,284 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:45,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:14:45,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {1377#false} assume !(0 == ~cond); {1377#false} is VALID [2022-02-20 17:14:45,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {1377#false} assume true; {1377#false} is VALID [2022-02-20 17:14:45,284 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1377#false} {1377#false} #58#return; {1377#false} is VALID [2022-02-20 17:14:45,285 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:45,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:14:45,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {1377#false} assume 0 == ~cond; {1377#false} is VALID [2022-02-20 17:14:45,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-02-20 17:14:45,286 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:45,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:45,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2022-02-20 17:14:45,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {1377#false} assume 0 == ~cond; {1377#false} is VALID [2022-02-20 17:14:45,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {1377#false} ~cond := #in~cond; {1377#false} is VALID [2022-02-20 17:14:45,467 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:45,468 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1376#true} {1377#false} #58#return; {1377#false} is VALID [2022-02-20 17:14:45,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:45,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:45,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:45,468 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:45,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {1473#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1377#false} is VALID [2022-02-20 17:14:45,476 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:45,476 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:45,477 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1376#true} {1388#(<= ~counter~0 1)} #56#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:45,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:45,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:45,477 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)); {1376#true} is VALID [2022-02-20 17:14:45,478 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1376#true} {1388#(<= ~counter~0 1)} #54#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:45,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:45,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:45,479 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)); {1376#true} is VALID [2022-02-20 17:14:45,479 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1376#true} {1388#(<= ~counter~0 1)} #52#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:45,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:45,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:45,480 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)); {1376#true} is VALID [2022-02-20 17:14:45,480 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1376#true} {1388#(<= ~counter~0 1)} #50#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:45,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:45,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:45,481 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)); {1376#true} is VALID [2022-02-20 17:14:45,482 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1376#true} {1388#(<= ~counter~0 1)} #48#return; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#true} assume true; {1376#true} is VALID [2022-02-20 17:14:45,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {1376#true} assume !(0 == ~cond); {1376#true} is VALID [2022-02-20 17:14:45,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} ~cond := #in~cond; {1376#true} is VALID [2022-02-20 17:14:45,482 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)); {1376#true} is VALID [2022-02-20 17:14:45,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {1388#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {1388#(<= ~counter~0 1)} is VALID [2022-02-20 17:14:45,483 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:45,484 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:45,484 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:45,485 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:45,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:45,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655482776] [2022-02-20 17:14:45,485 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:45,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936439046] [2022-02-20 17:14:45,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936439046] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:45,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:45,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2022-02-20 17:14:45,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158703105] [2022-02-20 17:14:45,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 41 [2022-02-20 17:14:45,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:45,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 17:14:45,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:45,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:45,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:45,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:45,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:45,541 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 17:14:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:45,687 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-02-20 17:14:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:14:45,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 41 [2022-02-20 17:14:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 17:14:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 17:14:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 17:14:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 17:14:45,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-02-20 17:14:45,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:45,770 INFO L225 Difference]: With dead ends: 68 [2022-02-20 17:14:45,770 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:14:45,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:14:45,775 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:45,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:14:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 17:14:45,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:45,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:45,808 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:45,812 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:45,814 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-20 17:14:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-20 17:14:45,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:45,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:45,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 52 states. [2022-02-20 17:14:45,816 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 52 states. [2022-02-20 17:14:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:45,818 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-20 17:14:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-20 17:14:45,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:45,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:45,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:45,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-02-20 17:14:45,824 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 41 [2022-02-20 17:14:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:45,824 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-02-20 17:14:45,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 17:14:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-20 17:14:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:14:45,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:45,828 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:45,853 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:46,050 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:46,051 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 1 times [2022-02-20 17:14:46,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:46,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944817322] [2022-02-20 17:14:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:46,080 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:46,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115282446] [2022-02-20 17:14:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:46,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:46,083 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:46,084 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:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:46,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:14:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:46,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:46,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {1907#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; {1907#true} is VALID [2022-02-20 17:14:46,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#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; {1915#(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:46,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1915#(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; {1915#(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:46,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {1915#(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 < 2);havoc main_#t~post5#1; {1915#(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:46,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {1915#(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)); {1907#true} is VALID [2022-02-20 17:14:46,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,370 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {1915#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #48#return; {1915#(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:46,370 INFO L272 TraceCheckUtils]: 9: Hoare triple {1915#(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)); {1907#true} is VALID [2022-02-20 17:14:46,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,375 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1907#true} {1915#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #50#return; {1915#(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:46,375 INFO L272 TraceCheckUtils]: 14: Hoare triple {1915#(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)); {1907#true} is VALID [2022-02-20 17:14:46,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,377 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1907#true} {1915#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #52#return; {1915#(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:46,378 INFO L272 TraceCheckUtils]: 19: Hoare triple {1915#(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)); {1907#true} is VALID [2022-02-20 17:14:46,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,379 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1907#true} {1915#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #54#return; {1915#(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:46,379 INFO L272 TraceCheckUtils]: 24: Hoare triple {1915#(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)); {1907#true} is VALID [2022-02-20 17:14:46,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,383 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1907#true} {1915#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #56#return; {1915#(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:46,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {1915#(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; {2000#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:46,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#(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; {2000#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:46,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {2000#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:46,385 INFO L272 TraceCheckUtils]: 32: Hoare triple {2000#(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)); {1907#true} is VALID [2022-02-20 17:14:46,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,386 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1907#true} {2000#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} #48#return; {2000#(and (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 0) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:14:46,387 INFO L272 TraceCheckUtils]: 37: Hoare triple {2000#(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)); {2025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:46,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {2025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:46,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {2029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1908#false} is VALID [2022-02-20 17:14:46,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2022-02-20 17:14:46,389 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:46,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:46,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2022-02-20 17:14:46,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {2029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1908#false} is VALID [2022-02-20 17:14:46,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {2025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:46,592 INFO L272 TraceCheckUtils]: 37: Hoare triple {2045#(= |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)); {2025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:46,592 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1907#true} {2045#(= |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; {2045#(= |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:46,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,593 INFO L272 TraceCheckUtils]: 32: Hoare triple {2045#(= |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)); {1907#true} is VALID [2022-02-20 17:14:46,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {2045#(= |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 < 2);havoc main_#t~post5#1; {2045#(= |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:46,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {2045#(= |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; {2045#(= |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:46,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {2070#(= (+ (* 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; {2045#(= |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:46,598 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1907#true} {2070#(= (+ (* 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; {2070#(= (+ (* 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:46,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,599 INFO L272 TraceCheckUtils]: 24: Hoare triple {2070#(= (+ (* 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)); {1907#true} is VALID [2022-02-20 17:14:46,600 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1907#true} {2070#(= (+ (* 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; {2070#(= (+ (* 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:46,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,600 INFO L272 TraceCheckUtils]: 19: Hoare triple {2070#(= (+ (* 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)); {1907#true} is VALID [2022-02-20 17:14:46,601 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1907#true} {2070#(= (+ (* 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; {2070#(= (+ (* 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:46,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,602 INFO L272 TraceCheckUtils]: 14: Hoare triple {2070#(= (+ (* 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)); {1907#true} is VALID [2022-02-20 17:14:46,602 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1907#true} {2070#(= (+ (* 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; {2070#(= (+ (* 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:46,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,603 INFO L272 TraceCheckUtils]: 9: Hoare triple {2070#(= (+ (* 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)); {1907#true} is VALID [2022-02-20 17:14:46,604 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {2070#(= (+ (* 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; {2070#(= (+ (* 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:46,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-02-20 17:14:46,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {1907#true} assume !(0 == ~cond); {1907#true} is VALID [2022-02-20 17:14:46,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {1907#true} ~cond := #in~cond; {1907#true} is VALID [2022-02-20 17:14:46,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#(= (+ (* 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)); {1907#true} is VALID [2022-02-20 17:14:46,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {2070#(= (+ (* 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 < 2);havoc main_#t~post5#1; {2070#(= (+ (* 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:46,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#(= (+ (* 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; {2070#(= (+ (* 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:46,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#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; {2070#(= (+ (* 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:46,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {1907#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; {1907#true} is VALID [2022-02-20 17:14:46,607 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:46,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:46,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944817322] [2022-02-20 17:14:46,607 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:46,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115282446] [2022-02-20 17:14:46,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115282446] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:46,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:46,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:14:46,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200978316] [2022-02-20 17:14:46,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:46,609 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:46,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:46,610 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:46,657 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:46,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:14:46,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:46,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:14:46,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:14:46,658 INFO L87 Difference]: Start difference. First operand 52 states and 63 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:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:47,639 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-02-20 17:14:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:14:47,639 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:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:47,640 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:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:47,642 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:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:47,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-02-20 17:14:47,747 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:47,748 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:14:47,749 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 17:14:47,749 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:47,749 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:47,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 208 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:14:47,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 17:14:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2022-02-20 17:14:47,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:47,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 60 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:47,771 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 60 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:47,771 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 60 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:47,774 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-02-20 17:14:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2022-02-20 17:14:47,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:47,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:47,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 72 states. [2022-02-20 17:14:47,776 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 72 states. [2022-02-20 17:14:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:47,779 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-02-20 17:14:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2022-02-20 17:14:47,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:47,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:47,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:47,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-02-20 17:14:47,782 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 41 [2022-02-20 17:14:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:47,783 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-02-20 17:14:47,783 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:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-02-20 17:14:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:14:47,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:47,784 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:47,810 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:48,005 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:48,006 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 2 times [2022-02-20 17:14:48,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:48,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49501273] [2022-02-20 17:14:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:48,020 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:48,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136469535] [2022-02-20 17:14:48,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:14:48,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:48,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:48,022 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:48,028 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:48,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:14:48,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:14:48,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:14:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:48,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:48,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {2506#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; {2506#true} is VALID [2022-02-20 17:14:48,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2506#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; {2514#(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:48,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {2514#(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; {2514#(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:48,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {2514#(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 < 2);havoc main_#t~post5#1; {2514#(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:48,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {2514#(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)); {2506#true} is VALID [2022-02-20 17:14:48,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,319 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2506#true} {2514#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #48#return; {2514#(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:48,319 INFO L272 TraceCheckUtils]: 9: Hoare triple {2514#(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)); {2506#true} is VALID [2022-02-20 17:14:48,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,320 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2506#true} {2514#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #50#return; {2514#(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:48,320 INFO L272 TraceCheckUtils]: 14: Hoare triple {2514#(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)); {2506#true} is VALID [2022-02-20 17:14:48,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,322 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2506#true} {2514#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #52#return; {2514#(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:48,322 INFO L272 TraceCheckUtils]: 19: Hoare triple {2514#(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)); {2506#true} is VALID [2022-02-20 17:14:48,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,323 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2506#true} {2514#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {2514#(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:48,323 INFO L272 TraceCheckUtils]: 24: Hoare triple {2514#(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)); {2506#true} is VALID [2022-02-20 17:14:48,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,324 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2506#true} {2514#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #56#return; {2514#(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:48,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {2514#(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; {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:48,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {2599#(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; {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:48,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} assume !!(main_#t~post5#1 < 2);havoc main_#t~post5#1; {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:48,325 INFO L272 TraceCheckUtils]: 32: Hoare triple {2599#(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)); {2506#true} is VALID [2022-02-20 17:14:48,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,326 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2506#true} {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} #48#return; {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:48,326 INFO L272 TraceCheckUtils]: 37: Hoare triple {2599#(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)); {2506#true} is VALID [2022-02-20 17:14:48,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,331 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2506#true} {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} #50#return; {2599#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 17:14:48,332 INFO L272 TraceCheckUtils]: 42: Hoare triple {2599#(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)); {2639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:48,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {2639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:48,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {2643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2507#false} is VALID [2022-02-20 17:14:48,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {2507#false} assume !false; {2507#false} is VALID [2022-02-20 17:14:48,335 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:48,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:48,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {2507#false} assume !false; {2507#false} is VALID [2022-02-20 17:14:48,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {2643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2507#false} is VALID [2022-02-20 17:14:48,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {2639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:48,528 INFO L272 TraceCheckUtils]: 42: Hoare triple {2659#(= (* |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)); {2639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:48,529 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2506#true} {2659#(= (* |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; {2659#(= (* |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:48,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,529 INFO L272 TraceCheckUtils]: 37: Hoare triple {2659#(= (* |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)); {2506#true} is VALID [2022-02-20 17:14:48,530 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2506#true} {2659#(= (* |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; {2659#(= (* |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:48,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,531 INFO L272 TraceCheckUtils]: 32: Hoare triple {2659#(= (* |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)); {2506#true} is VALID [2022-02-20 17:14:48,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {2659#(= (* |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 < 2);havoc main_#t~post5#1; {2659#(= (* |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:48,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {2659#(= (* |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; {2659#(= (* |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:48,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {2699#(= (+ |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; {2659#(= (* |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:48,534 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2506#true} {2699#(= (+ |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; {2699#(= (+ |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:48,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,536 INFO L272 TraceCheckUtils]: 24: Hoare triple {2699#(= (+ |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)); {2506#true} is VALID [2022-02-20 17:14:48,536 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2506#true} {2699#(= (+ |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; {2699#(= (+ |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:48,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,537 INFO L272 TraceCheckUtils]: 19: Hoare triple {2699#(= (+ |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)); {2506#true} is VALID [2022-02-20 17:14:48,538 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2506#true} {2699#(= (+ |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; {2699#(= (+ |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:48,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,538 INFO L272 TraceCheckUtils]: 14: Hoare triple {2699#(= (+ |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)); {2506#true} is VALID [2022-02-20 17:14:48,539 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2506#true} {2699#(= (+ |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; {2699#(= (+ |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:48,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,540 INFO L272 TraceCheckUtils]: 9: Hoare triple {2699#(= (+ |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)); {2506#true} is VALID [2022-02-20 17:14:48,540 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2506#true} {2699#(= (+ |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; {2699#(= (+ |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:48,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {2506#true} assume true; {2506#true} is VALID [2022-02-20 17:14:48,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {2506#true} assume !(0 == ~cond); {2506#true} is VALID [2022-02-20 17:14:48,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {2506#true} ~cond := #in~cond; {2506#true} is VALID [2022-02-20 17:14:48,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {2699#(= (+ |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)); {2506#true} is VALID [2022-02-20 17:14:48,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {2699#(= (+ |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 < 2);havoc main_#t~post5#1; {2699#(= (+ |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:48,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {2699#(= (+ |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; {2699#(= (+ |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:48,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {2506#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; {2699#(= (+ |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:48,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {2506#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; {2506#true} is VALID [2022-02-20 17:14:48,544 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:48,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:48,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49501273] [2022-02-20 17:14:48,544 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:48,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136469535] [2022-02-20 17:14:48,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136469535] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:48,545 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:48,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:14:48,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886856500] [2022-02-20 17:14:48,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:48,547 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:48,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:48,547 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:48,592 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:48,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:14:48,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:14:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:14:48,594 INFO L87 Difference]: Start difference. First operand 60 states and 69 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:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,081 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-02-20 17:14:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:14:49,081 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:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:49,082 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:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 17:14:49,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, (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:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 17:14:49,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-02-20 17:14:49,159 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:49,161 INFO L225 Difference]: With dead ends: 78 [2022-02-20 17:14:49,161 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 17:14:49,161 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:49,162 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:49,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 299 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:14:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 17:14:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2022-02-20 17:14:49,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:49,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 67 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:14:49,196 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 67 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:14:49,196 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 67 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:14:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,207 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2022-02-20 17:14:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2022-02-20 17:14:49,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-02-20 17:14:49,210 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 76 states. [2022-02-20 17:14:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,213 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2022-02-20 17:14:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2022-02-20 17:14:49,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:49,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:14:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-02-20 17:14:49,216 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 46 [2022-02-20 17:14:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:49,217 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-02-20 17:14:49,217 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:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-02-20 17:14:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 17:14:49,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:49,218 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:49,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:49,431 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:49,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 3 times [2022-02-20 17:14:49,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:49,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472560344] [2022-02-20 17:14:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:49,443 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:49,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499397064] [2022-02-20 17:14:49,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:14:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:49,445 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:49,453 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:49,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 17:14:49,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:14:49,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:14:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:49,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:49,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {3155#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; {3155#true} is VALID [2022-02-20 17:14:49,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {3155#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; {3163#(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:49,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {3163#(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; {3163#(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:49,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {3163#(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 < 2);havoc main_#t~post5#1; {3163#(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:49,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {3163#(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)); {3155#true} is VALID [2022-02-20 17:14:49,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,822 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3155#true} {3163#(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; {3163#(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:49,822 INFO L272 TraceCheckUtils]: 9: Hoare triple {3163#(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)); {3155#true} is VALID [2022-02-20 17:14:49,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,823 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3155#true} {3163#(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; {3163#(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:49,823 INFO L272 TraceCheckUtils]: 14: Hoare triple {3163#(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)); {3155#true} is VALID [2022-02-20 17:14:49,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,824 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3155#true} {3163#(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; {3163#(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:49,825 INFO L272 TraceCheckUtils]: 19: Hoare triple {3163#(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)); {3155#true} is VALID [2022-02-20 17:14:49,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,826 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3155#true} {3163#(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; {3163#(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:49,826 INFO L272 TraceCheckUtils]: 24: Hoare triple {3163#(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)); {3155#true} is VALID [2022-02-20 17:14:49,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,827 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3155#true} {3163#(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; {3163#(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:49,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {3163#(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; {3248#(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:49,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {3248#(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; {3248#(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:49,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {3248#(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 < 2);havoc main_#t~post5#1; {3248#(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:49,829 INFO L272 TraceCheckUtils]: 32: Hoare triple {3248#(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)); {3155#true} is VALID [2022-02-20 17:14:49,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,831 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3155#true} {3248#(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; {3248#(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:49,831 INFO L272 TraceCheckUtils]: 37: Hoare triple {3248#(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)); {3155#true} is VALID [2022-02-20 17:14:49,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,832 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3155#true} {3248#(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; {3248#(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:49,832 INFO L272 TraceCheckUtils]: 42: Hoare triple {3248#(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)); {3155#true} is VALID [2022-02-20 17:14:49,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:49,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:49,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:49,836 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3155#true} {3248#(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; {3248#(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:49,838 INFO L272 TraceCheckUtils]: 47: Hoare triple {3248#(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)); {3303#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:49,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {3303#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3307#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:49,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {3307#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3156#false} is VALID [2022-02-20 17:14:49,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {3156#false} assume !false; {3156#false} is VALID [2022-02-20 17:14:49,839 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:49,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:50,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {3156#false} assume !false; {3156#false} is VALID [2022-02-20 17:14:50,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {3307#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3156#false} is VALID [2022-02-20 17:14:50,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {3303#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3307#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:50,137 INFO L272 TraceCheckUtils]: 47: Hoare triple {3323#(= (+ (* |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)); {3303#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:50,137 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3155#true} {3323#(= (+ (* |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; {3323#(= (+ (* |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:50,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,138 INFO L272 TraceCheckUtils]: 42: Hoare triple {3323#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,138 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3155#true} {3323#(= (+ (* |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; {3323#(= (+ (* |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:50,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,139 INFO L272 TraceCheckUtils]: 37: Hoare triple {3323#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,140 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3155#true} {3323#(= (+ (* |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; {3323#(= (+ (* |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:50,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,140 INFO L272 TraceCheckUtils]: 32: Hoare triple {3323#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {3323#(= (+ (* |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 < 2);havoc main_#t~post5#1; {3323#(= (+ (* |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:50,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {3323#(= (+ (* |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; {3323#(= (+ (* |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:50,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {3378#(= (+ (* |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; {3323#(= (+ (* |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:50,145 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3155#true} {3378#(= (+ (* |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; {3378#(= (+ (* |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:50,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,146 INFO L272 TraceCheckUtils]: 24: Hoare triple {3378#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,147 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3155#true} {3378#(= (+ (* |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; {3378#(= (+ (* |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:50,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,147 INFO L272 TraceCheckUtils]: 19: Hoare triple {3378#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,148 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3155#true} {3378#(= (+ (* |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; {3378#(= (+ (* |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:50,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,148 INFO L272 TraceCheckUtils]: 14: Hoare triple {3378#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,149 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3155#true} {3378#(= (+ (* |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; {3378#(= (+ (* |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:50,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,149 INFO L272 TraceCheckUtils]: 9: Hoare triple {3378#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,150 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3155#true} {3378#(= (+ (* |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; {3378#(= (+ (* |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:50,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {3155#true} assume true; {3155#true} is VALID [2022-02-20 17:14:50,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {3155#true} assume !(0 == ~cond); {3155#true} is VALID [2022-02-20 17:14:50,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {3155#true} ~cond := #in~cond; {3155#true} is VALID [2022-02-20 17:14:50,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {3378#(= (+ (* |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)); {3155#true} is VALID [2022-02-20 17:14:50,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {3378#(= (+ (* |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 < 2);havoc main_#t~post5#1; {3378#(= (+ (* |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:50,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {3378#(= (+ (* |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; {3378#(= (+ (* |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:50,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {3155#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; {3378#(= (+ (* |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:50,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {3155#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; {3155#true} is VALID [2022-02-20 17:14:50,152 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:50,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:50,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472560344] [2022-02-20 17:14:50,153 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:50,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499397064] [2022-02-20 17:14:50,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499397064] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:50,153 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:50,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:14:50,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972321888] [2022-02-20 17:14:50,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:50,154 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:50,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:50,154 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:50,216 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:50,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:14:50,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:14:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:14:50,217 INFO L87 Difference]: Start difference. First operand 67 states and 78 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:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:51,596 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2022-02-20 17:14:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:14:51,597 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:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:51,598 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:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:51,605 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:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-02-20 17:14:51,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-02-20 17:14:51,729 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:51,731 INFO L225 Difference]: With dead ends: 86 [2022-02-20 17:14:51,731 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 17:14:51,731 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:51,732 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:51,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 173 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:14:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 17:14:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2022-02-20 17:14:51,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:51,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 72 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:51,753 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 72 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:51,753 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 72 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:51,755 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-02-20 17:14:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-02-20 17:14:51,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:51,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:51,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 78 states. [2022-02-20 17:14:51,756 INFO L87 Difference]: Start difference. First operand has 72 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 78 states. [2022-02-20 17:14:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:51,758 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-02-20 17:14:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-02-20 17:14:51,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:51,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:51,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:51,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-02-20 17:14:51,761 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 51 [2022-02-20 17:14:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:51,761 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-02-20 17:14:51,762 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:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-02-20 17:14:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:14:51,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:51,762 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:51,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:51,983 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:51,983 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2022-02-20 17:14:51,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:51,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140930592] [2022-02-20 17:14:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:51,994 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:51,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484332098] [2022-02-20 17:14:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:51,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:51,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:51,996 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:52,019 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:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:52,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 17:14:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:52,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:56,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {3854#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; {3854#true} is VALID [2022-02-20 17:14:56,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {3854#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; {3862#(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:14:56,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {3862#(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; {3862#(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:14:56,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {3862#(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 < 2);havoc main_#t~post5#1; {3862#(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:14:56,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {3862#(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)); {3854#true} is VALID [2022-02-20 17:14:56,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,760 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3854#true} {3862#(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; {3862#(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:14:56,760 INFO L272 TraceCheckUtils]: 9: Hoare triple {3862#(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)); {3854#true} is VALID [2022-02-20 17:14:56,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,761 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3854#true} {3862#(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; {3862#(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:14:56,761 INFO L272 TraceCheckUtils]: 14: Hoare triple {3862#(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)); {3854#true} is VALID [2022-02-20 17:14:56,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,762 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3854#true} {3862#(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; {3862#(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:14:56,762 INFO L272 TraceCheckUtils]: 19: Hoare triple {3862#(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)); {3854#true} is VALID [2022-02-20 17:14:56,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,763 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3854#true} {3862#(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; {3862#(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:14:56,763 INFO L272 TraceCheckUtils]: 24: Hoare triple {3862#(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)); {3854#true} is VALID [2022-02-20 17:14:56,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,764 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3854#true} {3862#(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; {3862#(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:14:56,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {3862#(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; {3947#(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:14:56,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {3947#(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; {3947#(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:14:56,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {3947#(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 < 2);havoc main_#t~post5#1; {3947#(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:14:56,766 INFO L272 TraceCheckUtils]: 32: Hoare triple {3947#(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)); {3854#true} is VALID [2022-02-20 17:14:56,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,767 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3854#true} {3947#(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; {3947#(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:14:56,767 INFO L272 TraceCheckUtils]: 37: Hoare triple {3947#(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)); {3854#true} is VALID [2022-02-20 17:14:56,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,768 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3854#true} {3947#(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; {3947#(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:14:56,769 INFO L272 TraceCheckUtils]: 42: Hoare triple {3947#(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)); {3854#true} is VALID [2022-02-20 17:14:56,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,770 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3854#true} {3947#(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; {3947#(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:14:56,770 INFO L272 TraceCheckUtils]: 47: Hoare triple {3947#(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)); {3854#true} is VALID [2022-02-20 17:14:56,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {3854#true} ~cond := #in~cond; {4005#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:56,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {4005#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:56,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:56,773 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} {3947#(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; {4016#(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:14:56,773 INFO L272 TraceCheckUtils]: 52: Hoare triple {4016#(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)); {3854#true} is VALID [2022-02-20 17:14:56,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,774 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3854#true} {4016#(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; {4016#(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:14:56,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {4016#(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); {4035#(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:14:56,776 INFO L272 TraceCheckUtils]: 58: Hoare triple {4035#(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)); {3854#true} is VALID [2022-02-20 17:14:56,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {3854#true} ~cond := #in~cond; {3854#true} is VALID [2022-02-20 17:14:56,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {3854#true} assume !(0 == ~cond); {3854#true} is VALID [2022-02-20 17:14:56,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {3854#true} assume true; {3854#true} is VALID [2022-02-20 17:14:56,777 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3854#true} {4035#(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; {4035#(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:14:56,778 INFO L272 TraceCheckUtils]: 63: Hoare triple {4035#(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)); {4054#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:56,778 INFO L290 TraceCheckUtils]: 64: Hoare triple {4054#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4058#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:56,779 INFO L290 TraceCheckUtils]: 65: Hoare triple {4058#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3855#false} is VALID [2022-02-20 17:14:56,779 INFO L290 TraceCheckUtils]: 66: Hoare triple {3855#false} assume !false; {3855#false} is VALID [2022-02-20 17:14:56,779 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:14:56,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:09,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:15:09,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140930592] [2022-02-20 17:15:09,833 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:15:09,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484332098] [2022-02-20 17:15:09,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484332098] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:09,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:09,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:15:09,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106422182] [2022-02-20 17:15:09,833 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:15:09,834 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:09,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:09,835 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:09,879 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:09,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:15:09,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:15:09,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:15:09,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:15:09,880 INFO L87 Difference]: Start difference. First operand 72 states and 78 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:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:11,097 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-02-20 17:15:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:15:11,097 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:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:11,098 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:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-02-20 17:15:11,101 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:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-02-20 17:15:11,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-02-20 17:15:11,173 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:11,175 INFO L225 Difference]: With dead ends: 92 [2022-02-20 17:15:11,175 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 17:15:11,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:15:11,176 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:11,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:15:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 17:15:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-02-20 17:15:11,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:11,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 13 states have call predecessors, (18), 13 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:11,225 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 13 states have call predecessors, (18), 13 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:11,225 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 13 states have call predecessors, (18), 13 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:11,227 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-02-20 17:15:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-02-20 17:15:11,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:11,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:11,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 13 states have call predecessors, (18), 13 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-02-20 17:15:11,228 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 13 states have call predecessors, (18), 13 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-02-20 17:15:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:11,231 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-02-20 17:15:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-02-20 17:15:11,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:11,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:11,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:11,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 13 states have call predecessors, (18), 13 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:15:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-02-20 17:15:11,234 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 67 [2022-02-20 17:15:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:11,234 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-02-20 17:15:11,234 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:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-02-20 17:15:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 17:15:11,235 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:11,235 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:11,257 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:11,451 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:11,452 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1946665570, now seen corresponding path program 2 times [2022-02-20 17:15:11,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:15:11,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533431308] [2022-02-20 17:15:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:11,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:15:11,461 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:15:11,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199984528] [2022-02-20 17:15:11,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:15:11,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:15:11,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:11,464 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:11,471 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:11,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:15:11,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-20 17:15:11,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:15:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:15:11,559 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:15:11,560 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:15:11,560 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:15:11,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:11,777 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:11,779 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:11,781 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:15:11,799 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); [2022-02-20 17:15:11,800 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:15:11,803 INFO L158 Benchmark]: Toolchain (without parser) took 31344.95ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 83.4MB in the beginning and 81.4MB in the end (delta: 2.0MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2022-02-20 17:15:11,803 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:15:11,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.53ms. Allocated memory is still 104.9MB. Free memory was 83.1MB in the beginning and 72.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:15:11,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 104.9MB. Free memory was 72.0MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:15:11,804 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 104.9MB. Free memory was 70.1MB in the beginning and 69.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:15:11,805 INFO L158 Benchmark]: RCFGBuilder took 297.52ms. Allocated memory is still 104.9MB. Free memory was 69.1MB in the beginning and 58.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:15:11,805 INFO L158 Benchmark]: TraceAbstraction took 30665.94ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 57.7MB in the beginning and 81.4MB in the end (delta: -23.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-02-20 17:15:11,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.53ms. Allocated memory is still 104.9MB. Free memory was 83.1MB in the beginning and 72.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 104.9MB. Free memory was 72.0MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 104.9MB. Free memory was 70.1MB in the beginning and 69.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.52ms. Allocated memory is still 104.9MB. Free memory was 69.1MB in the beginning and 58.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30665.94ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 57.7MB in the beginning and 81.4MB in the end (delta: -23.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:15:11,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:15:13,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:15:13,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:15:13,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:15:13,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:15:13,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:15:13,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:15:13,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:15:13,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:15:13,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:15:13,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:15:13,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:15:13,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:15:13,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:15:13,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:15:13,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:15:13,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:15:13,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:15:13,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:15:13,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:15:13,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:15:13,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:15:13,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:15:13,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:15:13,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:15:13,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:15:13,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:15:13,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:15:13,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:15:13,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:15:13,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:15:13,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:15:13,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:15:13,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:15:13,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:15:13,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:15:13,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:15:13,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:15:13,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:15:13,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:15:13,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:15:13,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:15:13,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:15:13,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:15:13,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:15:13,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:15:13,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:15:13,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:15:13,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:15:13,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:15:13,764 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:15:13,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:15:13,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:15:13,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:15:13,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:15:13,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:15:13,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:15:13,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:15:13,766 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:15:13,766 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:15:13,766 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:15:13,767 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:15:13,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:15:13,767 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:15:13,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:15:13,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:15:13,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:15:13,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:15:13,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:15:13,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:15:13,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:15:13,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:15:13,769 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:15:13,769 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:15:13,769 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:15:13,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:15:13,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:15:13,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:15:13,770 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 [2022-02-20 17:15:14,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:15:14,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:15:14,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:15:14,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:15:14,112 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:15:14,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-02-20 17:15:14,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35dbdf39c/a4b87a5e2d9e4c87b78f03353b887555/FLAGa7128aa6a [2022-02-20 17:15:14,582 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:15:14,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-02-20 17:15:14,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35dbdf39c/a4b87a5e2d9e4c87b78f03353b887555/FLAGa7128aa6a [2022-02-20 17:15:14,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35dbdf39c/a4b87a5e2d9e4c87b78f03353b887555 [2022-02-20 17:15:14,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:15:14,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:15:14,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:15:14,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:15:14,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:15:14,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:15:14" (1/1) ... [2022-02-20 17:15:14,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac359fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:14, skipping insertion in model container [2022-02-20 17:15:14,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:15:14" (1/1) ... [2022-02-20 17:15:14,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:15:14,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:15:15,113 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_unwindbound2.c[588,601] [2022-02-20 17:15:15,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:15:15,175 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:15:15,192 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_unwindbound2.c[588,601] [2022-02-20 17:15:15,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:15:15,230 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:15:15,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15 WrapperNode [2022-02-20 17:15:15,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:15:15,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:15:15,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:15:15,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:15:15,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,281 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-02-20 17:15:15,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:15:15,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:15:15,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:15:15,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:15:15,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:15:15,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:15:15,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:15:15,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:15:15,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (1/1) ... [2022-02-20 17:15:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:15:15,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:15:15,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:15:15,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:15:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:15:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:15:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:15:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:15:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:15:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:15:15,471 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:15:15,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:15:15,626 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:15:15,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:15:15,633 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:15:15,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:15:15 BoogieIcfgContainer [2022-02-20 17:15:15,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:15:15,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:15:15,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:15:15,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:15:15,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:15:14" (1/3) ... [2022-02-20 17:15:15,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475faaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:15:15, skipping insertion in model container [2022-02-20 17:15:15,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:15:15" (2/3) ... [2022-02-20 17:15:15,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475faaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:15:15, skipping insertion in model container [2022-02-20 17:15:15,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:15:15" (3/3) ... [2022-02-20 17:15:15,642 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2022-02-20 17:15:15,651 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:15:15,651 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:15:15,705 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:15:15,711 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:15:15,711 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:15:15,725 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:15:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:15:15,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:15,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:15,729 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:15,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-02-20 17:15:15,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:15:15,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347704373] [2022-02-20 17:15:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:15:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:15:15,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:15:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:15:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:15,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:15:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:15,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:15,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {29#true} is VALID [2022-02-20 17:15:15,861 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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {29#true} is VALID [2022-02-20 17:15:15,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 17:15:15,862 INFO L272 TraceCheckUtils]: 3: Hoare triple {30#false} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {30#false} is VALID [2022-02-20 17:15:15,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:15:15,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2022-02-20 17:15:15,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:15:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:15,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:15,864 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:15:15,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347704373] [2022-02-20 17:15:15,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347704373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:15,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:15,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:15:15,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67622361] [2022-02-20 17:15:15,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:15,871 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:15:15,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:15,874 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:15:15,886 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:15:15,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:15:15,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:15:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:15:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:15:15,905 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:15:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:17,573 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-02-20 17:15:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:15:17,574 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:15:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:17,575 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:15:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:15:17,585 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:15:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:15:17,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:15:18,990 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:15:18,997 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:15:18,997 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:15:19,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:15:19,003 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:19,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:15:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:15:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:15:19,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:19,025 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:15:19,026 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:15:19,026 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:15:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:19,031 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:15:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:15:19,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:19,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:19,033 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:15:19,033 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:15:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:19,042 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:15:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:15:19,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:19,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:19,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:19,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:19,044 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:15:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-02-20 17:15:19,048 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-02-20 17:15:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:19,049 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-02-20 17:15:19,049 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:15:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:15:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:15:19,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:19,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:19,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 17:15:19,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:15:19,259 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-02-20 17:15:19,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:15:19,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279975286] [2022-02-20 17:15:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:19,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:15:19,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:15:19,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:15:19,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:15:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:19,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:15:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:19,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:19,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {208#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {213#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:15:19,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(= ~counter~0 (_ bv0 32))} 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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {213#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:15:19,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {220#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} is VALID [2022-02-20 17:15:19,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} assume !~bvslt32(main_#t~post5#1, 2bv32);havoc main_#t~post5#1; {209#false} is VALID [2022-02-20 17:15:19,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {209#false} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {209#false} is VALID [2022-02-20 17:15:19,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-02-20 17:15:19,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#false} assume 0bv32 == ~cond; {209#false} is VALID [2022-02-20 17:15:19,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-02-20 17:15:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:19,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:19,388 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:15:19,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279975286] [2022-02-20 17:15:19,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279975286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:19,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:19,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:15:19,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124016058] [2022-02-20 17:15:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:19,396 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:15:19,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:19,397 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:15:19,408 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:15:19,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:15:19,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:15:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:15:19,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:15:19,411 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:15:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:24,315 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-20 17:15:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:15:24,316 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:15:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:24,316 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:15:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:15:24,320 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:15:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:15:24,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-02-20 17:15:25,283 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:25,284 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:15:25,284 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:15:25,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:15:25,286 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:15:25,286 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:15:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:15:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:15:25,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:25,291 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:15:25,292 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:15:25,292 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:15:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:25,295 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:15:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:15:25,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:25,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:25,296 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:15:25,297 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:15:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:25,300 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:15:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:15:25,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:25,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:25,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:25,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:25,301 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:15:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-02-20 17:15:25,304 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-02-20 17:15:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:25,304 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-02-20 17:15:25,304 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:15:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:15:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:15:25,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:25,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:25,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:25,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:15:25,510 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-02-20 17:15:25,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:15:25,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866688104] [2022-02-20 17:15:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:25,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:15:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:15:25,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:15:25,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:15:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:25,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:15:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:25,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:25,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {378#true} is VALID [2022-02-20 17:15:25,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:25,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:25,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} assume !!~bvslt32(main_#t~post5#1, 2bv32);havoc main_#t~post5#1; {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:25,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {396#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:25,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {400#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:15:25,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {400#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {379#false} is VALID [2022-02-20 17:15:25,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-02-20 17:15:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:25,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:25,684 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:15:25,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866688104] [2022-02-20 17:15:25,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866688104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:25,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:25,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:25,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8941586] [2022-02-20 17:15:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:25,686 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:15:25,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:25,686 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:15:25,697 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:15:25,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:25,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:15:25,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:25,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:25,699 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:15:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:32,055 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2022-02-20 17:15:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:32,056 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:15:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:32,056 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:15:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:15:32,059 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:15:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:15:32,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:15:33,158 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:15:33,160 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:15:33,160 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:15:33,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:15:33,162 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:33,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 131 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:15:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:15:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-02-20 17:15:33,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:33,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:33,170 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:33,170 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:33,174 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2022-02-20 17:15:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2022-02-20 17:15:33,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:33,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:33,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 40 states. [2022-02-20 17:15:33,176 INFO L87 Difference]: Start difference. First operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 40 states. [2022-02-20 17:15:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:33,180 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2022-02-20 17:15:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2022-02-20 17:15:33,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:33,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:33,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:33,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-02-20 17:15:33,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 8 [2022-02-20 17:15:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:33,186 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-02-20 17:15:33,186 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:15:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-02-20 17:15:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:15:33,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:33,187 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:33,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:33,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:15:33,395 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-02-20 17:15:33,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:15:33,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020894468] [2022-02-20 17:15:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:33,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:15:33,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:15:33,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:15:33,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 17:15:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:33,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:15:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:33,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:33,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {612#true} is VALID [2022-02-20 17:15:33,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:15:33,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:15:33,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} assume !!~bvslt32(main_#t~post5#1, 2bv32);havoc main_#t~post5#1; {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:15:33,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {612#true} is VALID [2022-02-20 17:15:33,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {612#true} ~cond := #in~cond; {612#true} is VALID [2022-02-20 17:15:33,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {612#true} assume !(0bv32 == ~cond); {612#true} is VALID [2022-02-20 17:15:33,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {612#true} assume true; {612#true} is VALID [2022-02-20 17:15:33,593 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {612#true} {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} #48#return; {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:15:33,598 INFO L272 TraceCheckUtils]: 9: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~y~0#1 == ~bvadd64(1bv64, ~bvadd64(~bvmul64(~bvmul64(3bv64, main_~n~0#1), main_~n~0#1), ~bvmul64(3bv64, main_~n~0#1))) then 1bv32 else 0bv32)); {645#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:33,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {645#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {649#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:15:33,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {613#false} is VALID [2022-02-20 17:15:33,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#false} assume !false; {613#false} is VALID [2022-02-20 17:15:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:15:33,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:33,600 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:15:33,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020894468] [2022-02-20 17:15:33,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020894468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:33,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:33,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:33,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23957778] [2022-02-20 17:15:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:33,601 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:15:33,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:33,601 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:15:33,639 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:15:33,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:33,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:15:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:33,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:33,641 INFO L87 Difference]: Start difference. First operand 35 states and 52 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:15:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:40,313 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-02-20 17:15:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:15:40,313 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:15:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:40,313 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:15:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:15:40,315 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:15:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:15:40,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:15:41,400 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:15:41,402 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:15:41,402 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:15:41,402 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:15:41,403 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:41,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 140 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 17:15:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:15:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-02-20 17:15:41,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:41,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:41,411 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:41,411 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:41,415 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:15:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:15:41,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:41,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:41,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 44 states. [2022-02-20 17:15:41,417 INFO L87 Difference]: Start difference. First operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 44 states. [2022-02-20 17:15:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:41,421 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:15:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:15:41,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:41,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:41,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:41,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:15:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2022-02-20 17:15:41,425 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 13 [2022-02-20 17:15:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:41,426 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2022-02-20 17:15:41,426 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:15:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2022-02-20 17:15:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:15:41,427 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:41,427 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:41,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:41,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:15:41,637 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-02-20 17:15:41,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:15:41,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795898088] [2022-02-20 17:15:41,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:41,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:15:41,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:15:41,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:15:41,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 17:15:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:41,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:15:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:41,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:41,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {879#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {879#true} is VALID [2022-02-20 17:15:41,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:15:41,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:15:41,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} assume !!~bvslt32(main_#t~post5#1, 2bv32);havoc main_#t~post5#1; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:15:41,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {879#true} is VALID [2022-02-20 17:15:41,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#true} ~cond := #in~cond; {879#true} is VALID [2022-02-20 17:15:41,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#true} assume !(0bv32 == ~cond); {879#true} is VALID [2022-02-20 17:15:41,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#true} assume true; {879#true} is VALID [2022-02-20 17:15:41,914 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {879#true} {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} #48#return; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:15:41,914 INFO L272 TraceCheckUtils]: 9: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == ~bvadd64(1bv64, ~bvadd64(~bvmul64(~bvmul64(3bv64, main_~n~0#1), main_~n~0#1), ~bvmul64(3bv64, main_~n~0#1))) then 1bv32 else 0bv32)); {879#true} is VALID [2022-02-20 17:15:41,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#true} ~cond := #in~cond; {879#true} is VALID [2022-02-20 17:15:41,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#true} assume !(0bv32 == ~cond); {879#true} is VALID [2022-02-20 17:15:41,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {879#true} assume true; {879#true} is VALID [2022-02-20 17:15:41,915 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {879#true} {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} #50#return; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:15:41,919 INFO L272 TraceCheckUtils]: 14: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == ~bvmul64(~bvmul64(main_~n~0#1, main_~n~0#1), main_~n~0#1) then 1bv32 else 0bv32)); {927#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:41,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {927#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {931#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:15:41,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {931#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {880#false} is VALID [2022-02-20 17:15:41,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {880#false} assume !false; {880#false} is VALID [2022-02-20 17:15:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:15:41,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:15:41,921 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:15:41,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795898088] [2022-02-20 17:15:41,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795898088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:15:41,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:15:41,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:15:41,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284475913] [2022-02-20 17:15:41,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:41,923 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:15:41,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:41,923 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:15:42,042 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:15:42,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:42,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:15:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:15:42,043 INFO L87 Difference]: Start difference. First operand 39 states and 55 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)