./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.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 c7cbe6ad395b0d81984b9de528b8d735c1f87c97 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/egcd3-ll_valuebound5.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 c7cbe6ad395b0d81984b9de528b8d735c1f87c97 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@32a16cfe --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:26:54,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:26:54,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:26:54,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:26:54,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:26:54,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:26:54,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:26:54,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:26:54,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:26:54,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:26:54,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:26:54,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:26:54,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:26:54,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:26:54,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:26:54,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:26:54,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:26:54,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:26:54,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:26:54,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:26:54,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:26:54,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:26:54,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:26:54,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:26:54,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:26:54,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:26:54,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:26:54,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:26:54,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:26:54,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:26:54,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:26:54,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:26:54,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:26:54,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:26:54,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:26:54,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:26:54,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:26:54,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:26:54,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:26:54,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:26:54,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:26:54,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:26:54,753 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:26:54,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:26:54,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:26:54,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:26:54,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:26:54,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:26:54,757 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:26:54,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:26:54,757 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:26:54,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:26:54,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:26:54,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:26:54,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:26:54,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:26:54,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:26:54,759 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:26:54,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:26:54,759 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:26:54,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:26:54,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:26:54,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:26:54,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:26:54,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:26:54,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:26:54,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:26:54,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:26:54,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:26:54,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:26:54,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:26:54,761 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:26:54,761 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 -> c7cbe6ad395b0d81984b9de528b8d735c1f87c97 [2021-09-13 14:26:55,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:26:55,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:26:55,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:26:55,035 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:26:55,036 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:26:55,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c [2021-09-13 14:26:55,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5dfa7c67/5823066240c44f9c9face74856de4bea/FLAG591fbd878 [2021-09-13 14:26:55,478 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:26:55,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c [2021-09-13 14:26:55,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5dfa7c67/5823066240c44f9c9face74856de4bea/FLAG591fbd878 [2021-09-13 14:26:55,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5dfa7c67/5823066240c44f9c9face74856de4bea [2021-09-13 14:26:55,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:26:55,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:26:55,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:26:55,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:26:55,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:26:55,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f475d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55, skipping insertion in model container [2021-09-13 14:26:55,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:26:55,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:26:55,609 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c[490,503] [2021-09-13 14:26:55,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:26:55,638 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:26:55,646 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c[490,503] [2021-09-13 14:26:55,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:26:55,661 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:26:55,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55 WrapperNode [2021-09-13 14:26:55,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:26:55,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:26:55,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:26:55,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:26:55,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:26:55,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:26:55,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:26:55,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:26:55,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:26:55,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:26:55,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:26:55,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:26:55,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (1/1) ... [2021-09-13 14:26:55,764 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:26:55,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:55,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:26:55,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:26:55,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:26:55,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:26:55,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:26:55,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:26:56,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:26:56,028 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-09-13 14:26:56,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:26:56 BoogieIcfgContainer [2021-09-13 14:26:56,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:26:56,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:26:56,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:26:56,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:26:56,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:26:55" (1/3) ... [2021-09-13 14:26:56,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d267286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:26:56, skipping insertion in model container [2021-09-13 14:26:56,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:55" (2/3) ... [2021-09-13 14:26:56,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d267286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:26:56, skipping insertion in model container [2021-09-13 14:26:56,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:26:56" (3/3) ... [2021-09-13 14:26:56,036 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound5.c [2021-09-13 14:26:56,039 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:26:56,058 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:26:56,101 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:26:56,106 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:26:56,106 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:26:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:26:56,137 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:56,137 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:56,137 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash -174497841, now seen corresponding path program 1 times [2021-09-13 14:26:56,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:56,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728927543] [2021-09-13 14:26:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:56,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:56,274 INFO L281 TraceCheckUtils]: 0: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {44#true} is VALID [2021-09-13 14:26:56,275 INFO L281 TraceCheckUtils]: 1: Hoare triple {44#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {44#true} is VALID [2021-09-13 14:26:56,276 INFO L281 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:26:56,276 INFO L281 TraceCheckUtils]: 3: Hoare triple {45#false} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:26:56,276 INFO L281 TraceCheckUtils]: 4: Hoare triple {45#false} assume 0 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:26:56,276 INFO L281 TraceCheckUtils]: 5: Hoare triple {45#false} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:26:56,277 INFO L281 TraceCheckUtils]: 6: Hoare triple {45#false} assume 0 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:26:56,278 INFO L281 TraceCheckUtils]: 7: Hoare triple {45#false} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:26:56,278 INFO L281 TraceCheckUtils]: 8: Hoare triple {45#false} assume 0 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:26:56,278 INFO L281 TraceCheckUtils]: 9: Hoare triple {45#false} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {45#false} is VALID [2021-09-13 14:26:56,278 INFO L281 TraceCheckUtils]: 10: Hoare triple {45#false} assume false; {45#false} is VALID [2021-09-13 14:26:56,279 INFO L281 TraceCheckUtils]: 11: Hoare triple {45#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {45#false} is VALID [2021-09-13 14:26:56,279 INFO L281 TraceCheckUtils]: 12: Hoare triple {45#false} assume 0 == __VERIFIER_assert_~cond; {45#false} is VALID [2021-09-13 14:26:56,279 INFO L281 TraceCheckUtils]: 13: Hoare triple {45#false} assume !false; {45#false} is VALID [2021-09-13 14:26:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:56,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:56,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728927543] [2021-09-13 14:26:56,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728927543] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:56,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:56,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:26:56,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616150289] [2021-09-13 14:26:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:26:56,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:56,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:56,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:26:56,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:26:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:26:56,342 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:56,451 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2021-09-13 14:26:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:26:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:26:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:26:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:26:56,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:26:56,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:56,562 INFO L225 Difference]: With dead ends: 79 [2021-09-13 14:26:56,562 INFO L226 Difference]: Without dead ends: 37 [2021-09-13 14:26:56,564 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:26:56,566 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.34ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:56,567 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 40.34ms Time] [2021-09-13 14:26:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-09-13 14:26:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-09-13 14:26:56,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:56,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,587 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,588 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:56,593 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:26:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:26:56,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:56,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:56,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 14:26:56,595 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 14:26:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:56,597 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:26:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:26:56,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:56,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:56,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:56,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-09-13 14:26:56,602 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 14 [2021-09-13 14:26:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:56,603 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-09-13 14:26:56,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:26:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:26:56,604 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:56,604 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:56,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:26:56,605 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1454170515, now seen corresponding path program 1 times [2021-09-13 14:26:56,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:56,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337604157] [2021-09-13 14:26:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:56,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:56,624 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:56,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797030353] [2021-09-13 14:26:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:56,627 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:56,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:56,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:26:56,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:26:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:56,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:26:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:56,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:56,869 INFO L281 TraceCheckUtils]: 0: Hoare triple {263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {263#true} is VALID [2021-09-13 14:26:56,869 INFO L281 TraceCheckUtils]: 1: Hoare triple {263#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {263#true} is VALID [2021-09-13 14:26:56,870 INFO L281 TraceCheckUtils]: 2: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:26:56,870 INFO L281 TraceCheckUtils]: 3: Hoare triple {263#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {263#true} is VALID [2021-09-13 14:26:56,870 INFO L281 TraceCheckUtils]: 4: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:26:56,870 INFO L281 TraceCheckUtils]: 5: Hoare triple {263#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {263#true} is VALID [2021-09-13 14:26:56,870 INFO L281 TraceCheckUtils]: 6: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:26:56,871 INFO L281 TraceCheckUtils]: 7: Hoare triple {263#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {289#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:26:56,872 INFO L281 TraceCheckUtils]: 8: Hoare triple {289#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} assume !(0 == assume_abort_if_not_~cond); {293#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:26:56,872 INFO L281 TraceCheckUtils]: 9: Hoare triple {293#(<= 1 ULTIMATE.start_main_~y~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {297#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:56,873 INFO L281 TraceCheckUtils]: 10: Hoare triple {297#(<= 1 ULTIMATE.start_main_~b~0)} assume !false; {297#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:56,873 INFO L281 TraceCheckUtils]: 11: Hoare triple {297#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {264#false} is VALID [2021-09-13 14:26:56,873 INFO L281 TraceCheckUtils]: 12: Hoare triple {264#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {264#false} is VALID [2021-09-13 14:26:56,873 INFO L281 TraceCheckUtils]: 13: Hoare triple {264#false} assume 0 == __VERIFIER_assert_~cond; {264#false} is VALID [2021-09-13 14:26:56,874 INFO L281 TraceCheckUtils]: 14: Hoare triple {264#false} assume !false; {264#false} is VALID [2021-09-13 14:26:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:56,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:56,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:56,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337604157] [2021-09-13 14:26:56,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:56,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797030353] [2021-09-13 14:26:56,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797030353] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:56,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:56,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:26:56,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475242592] [2021-09-13 14:26:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-13 14:26:56,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:56,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:56,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:56,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:26:56,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:26:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:26:56,891 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:57,091 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-09-13 14:26:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:26:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-13 14:26:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2021-09-13 14:26:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2021-09-13 14:26:57,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2021-09-13 14:26:57,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:57,144 INFO L225 Difference]: With dead ends: 64 [2021-09-13 14:26:57,144 INFO L226 Difference]: Without dead ends: 60 [2021-09-13 14:26:57,145 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.00ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:26:57,146 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.12ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.87ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:57,146 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 2.12ms Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 56.87ms Time] [2021-09-13 14:26:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-09-13 14:26:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2021-09-13 14:26:57,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:57,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,164 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,164 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:57,166 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-09-13 14:26:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-09-13 14:26:57,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:57,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:57,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2021-09-13 14:26:57,167 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2021-09-13 14:26:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:57,169 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-09-13 14:26:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-09-13 14:26:57,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:57,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:57,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:57,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-09-13 14:26:57,171 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 15 [2021-09-13 14:26:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:57,172 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-09-13 14:26:57,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:26:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:26:57,172 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:57,173 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:57,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-09-13 14:26:57,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:57,390 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1580206288, now seen corresponding path program 1 times [2021-09-13 14:26:57,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:57,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409917116] [2021-09-13 14:26:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:57,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:57,405 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:57,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608038532] [2021-09-13 14:26:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:57,415 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:57,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:57,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:26:57,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:26:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:57,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:26:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:57,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:57,846 INFO L281 TraceCheckUtils]: 0: Hoare triple {561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {561#true} is VALID [2021-09-13 14:26:57,846 INFO L281 TraceCheckUtils]: 1: Hoare triple {561#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {561#true} is VALID [2021-09-13 14:26:57,847 INFO L281 TraceCheckUtils]: 2: Hoare triple {561#true} assume !(0 == assume_abort_if_not_~cond); {561#true} is VALID [2021-09-13 14:26:57,848 INFO L281 TraceCheckUtils]: 3: Hoare triple {561#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {575#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:26:57,848 INFO L281 TraceCheckUtils]: 4: Hoare triple {575#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {579#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:57,849 INFO L281 TraceCheckUtils]: 5: Hoare triple {579#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {579#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:57,849 INFO L281 TraceCheckUtils]: 6: Hoare triple {579#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {579#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:57,850 INFO L281 TraceCheckUtils]: 7: Hoare triple {579#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {589#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:57,850 INFO L281 TraceCheckUtils]: 8: Hoare triple {589#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {593#(and (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:57,851 INFO L281 TraceCheckUtils]: 9: Hoare triple {593#(and (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:26:57,851 INFO L281 TraceCheckUtils]: 10: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !false; {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:26:57,851 INFO L281 TraceCheckUtils]: 11: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:26:57,852 INFO L281 TraceCheckUtils]: 12: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !false; {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:26:57,852 INFO L281 TraceCheckUtils]: 13: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:26:57,853 INFO L281 TraceCheckUtils]: 14: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~y~0 5) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {613#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:26:57,853 INFO L281 TraceCheckUtils]: 15: Hoare triple {613#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {562#false} is VALID [2021-09-13 14:26:57,853 INFO L281 TraceCheckUtils]: 16: Hoare triple {562#false} assume !false; {562#false} is VALID [2021-09-13 14:26:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:57,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:57,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:57,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409917116] [2021-09-13 14:26:57,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:57,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608038532] [2021-09-13 14:26:57,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608038532] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:57,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:57,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-09-13 14:26:57,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754576033] [2021-09-13 14:26:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-09-13 14:26:57,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:57,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:57,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:57,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:26:57,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:26:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:26:57,879 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:58,326 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-09-13 14:26:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:26:58,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-09-13 14:26:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2021-09-13 14:26:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2021-09-13 14:26:58,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2021-09-13 14:26:58,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:58,390 INFO L225 Difference]: With dead ends: 60 [2021-09-13 14:26:58,390 INFO L226 Difference]: Without dead ends: 58 [2021-09-13 14:26:58,390 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 178.90ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:26:58,391 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.74ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 109.04ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:58,391 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 3.74ms Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 109.04ms Time] [2021-09-13 14:26:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-09-13 14:26:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2021-09-13 14:26:58,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:58,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,420 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,421 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:58,422 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-09-13 14:26:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-09-13 14:26:58,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:58,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:58,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2021-09-13 14:26:58,423 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2021-09-13 14:26:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:58,425 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-09-13 14:26:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-09-13 14:26:58,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:58,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:58,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:58,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2021-09-13 14:26:58,427 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2021-09-13 14:26:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:58,427 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2021-09-13 14:26:58,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2021-09-13 14:26:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:26:58,428 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:58,428 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:58,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-09-13 14:26:58,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-09-13 14:26:58,641 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1840022701, now seen corresponding path program 1 times [2021-09-13 14:26:58,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:58,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602251198] [2021-09-13 14:26:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:58,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:58,653 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:58,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791631662] [2021-09-13 14:26:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:58,654 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:58,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:26:58,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:26:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:58,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:26:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:58,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:59,118 INFO L281 TraceCheckUtils]: 0: Hoare triple {882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {882#true} is VALID [2021-09-13 14:26:59,118 INFO L281 TraceCheckUtils]: 1: Hoare triple {882#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {882#true} is VALID [2021-09-13 14:26:59,118 INFO L281 TraceCheckUtils]: 2: Hoare triple {882#true} assume !(0 == assume_abort_if_not_~cond); {882#true} is VALID [2021-09-13 14:26:59,119 INFO L281 TraceCheckUtils]: 3: Hoare triple {882#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {896#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:26:59,120 INFO L281 TraceCheckUtils]: 4: Hoare triple {896#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,123 INFO L281 TraceCheckUtils]: 5: Hoare triple {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,123 INFO L281 TraceCheckUtils]: 6: Hoare triple {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,124 INFO L281 TraceCheckUtils]: 7: Hoare triple {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,124 INFO L281 TraceCheckUtils]: 8: Hoare triple {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,125 INFO L281 TraceCheckUtils]: 9: Hoare triple {900#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {916#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,128 INFO L281 TraceCheckUtils]: 10: Hoare triple {916#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {916#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,129 INFO L281 TraceCheckUtils]: 11: Hoare triple {916#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,129 INFO L281 TraceCheckUtils]: 12: Hoare triple {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,130 INFO L281 TraceCheckUtils]: 13: Hoare triple {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,130 INFO L281 TraceCheckUtils]: 14: Hoare triple {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,131 INFO L281 TraceCheckUtils]: 15: Hoare triple {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:59,132 INFO L281 TraceCheckUtils]: 16: Hoare triple {923#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {939#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:26:59,132 INFO L281 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {883#false} is VALID [2021-09-13 14:26:59,132 INFO L281 TraceCheckUtils]: 18: Hoare triple {883#false} assume !false; {883#false} is VALID [2021-09-13 14:26:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:59,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:59,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:59,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602251198] [2021-09-13 14:26:59,133 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:59,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791631662] [2021-09-13 14:26:59,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791631662] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:59,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:59,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:26:59,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486760279] [2021-09-13 14:26:59,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:26:59,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:59,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:59,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:26:59,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:59,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:26:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:26:59,150 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:59,491 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-09-13 14:26:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:26:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:26:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2021-09-13 14:26:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2021-09-13 14:26:59,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2021-09-13 14:26:59,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:59,527 INFO L225 Difference]: With dead ends: 58 [2021-09-13 14:26:59,527 INFO L226 Difference]: Without dead ends: 56 [2021-09-13 14:26:59,527 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 70.94ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:26:59,528 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.00ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 135.74ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:59,528 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 198 Unknown, 0 Unchecked, 1.00ms Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 135.74ms Time] [2021-09-13 14:26:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-09-13 14:26:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2021-09-13 14:26:59,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:59,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,592 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,593 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:59,594 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-09-13 14:26:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-09-13 14:26:59,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:59,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:59,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2021-09-13 14:26:59,595 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2021-09-13 14:26:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:59,596 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-09-13 14:26:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-09-13 14:26:59,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:59,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:59,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:59,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-09-13 14:26:59,598 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 19 [2021-09-13 14:26:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:59,598 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-09-13 14:26:59,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-09-13 14:26:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:26:59,599 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:59,599 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:59,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:26:59,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:59,805 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1412177226, now seen corresponding path program 1 times [2021-09-13 14:26:59,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:59,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22077593] [2021-09-13 14:26:59,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:59,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:59,815 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:59,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601010805] [2021-09-13 14:26:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:59,815 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:59,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:26:59,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:26:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:59,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:26:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:59,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:00,029 INFO L281 TraceCheckUtils]: 0: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1198#true} is VALID [2021-09-13 14:27:00,029 INFO L281 TraceCheckUtils]: 1: Hoare triple {1198#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1198#true} is VALID [2021-09-13 14:27:00,029 INFO L281 TraceCheckUtils]: 2: Hoare triple {1198#true} assume !(0 == assume_abort_if_not_~cond); {1198#true} is VALID [2021-09-13 14:27:00,030 INFO L281 TraceCheckUtils]: 3: Hoare triple {1198#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1198#true} is VALID [2021-09-13 14:27:00,030 INFO L281 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == assume_abort_if_not_~cond); {1198#true} is VALID [2021-09-13 14:27:00,030 INFO L281 TraceCheckUtils]: 5: Hoare triple {1198#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1218#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} is VALID [2021-09-13 14:27:00,031 INFO L281 TraceCheckUtils]: 6: Hoare triple {1218#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} assume !(0 == assume_abort_if_not_~cond); {1222#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:00,031 INFO L281 TraceCheckUtils]: 7: Hoare triple {1222#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1222#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:00,031 INFO L281 TraceCheckUtils]: 8: Hoare triple {1222#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {1222#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:00,032 INFO L281 TraceCheckUtils]: 9: Hoare triple {1222#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {1232#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:00,032 INFO L281 TraceCheckUtils]: 10: Hoare triple {1232#(<= 1 ULTIMATE.start_main_~a~0)} assume !false; {1232#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:00,033 INFO L281 TraceCheckUtils]: 11: Hoare triple {1232#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {1239#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:00,033 INFO L281 TraceCheckUtils]: 12: Hoare triple {1239#(<= 1 ULTIMATE.start_main_~c~0)} assume !false; {1239#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:00,033 INFO L281 TraceCheckUtils]: 13: Hoare triple {1239#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {1239#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:00,034 INFO L281 TraceCheckUtils]: 14: Hoare triple {1239#(<= 1 ULTIMATE.start_main_~c~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {1249#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:00,034 INFO L281 TraceCheckUtils]: 15: Hoare triple {1249#(<= 1 ULTIMATE.start_main_~b~0)} assume !false; {1249#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:00,034 INFO L281 TraceCheckUtils]: 16: Hoare triple {1249#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {1199#false} is VALID [2021-09-13 14:27:00,035 INFO L281 TraceCheckUtils]: 17: Hoare triple {1199#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1199#false} is VALID [2021-09-13 14:27:00,035 INFO L281 TraceCheckUtils]: 18: Hoare triple {1199#false} assume 0 == __VERIFIER_assert_~cond; {1199#false} is VALID [2021-09-13 14:27:00,035 INFO L281 TraceCheckUtils]: 19: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2021-09-13 14:27:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:00,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:00,160 INFO L281 TraceCheckUtils]: 19: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2021-09-13 14:27:00,161 INFO L281 TraceCheckUtils]: 18: Hoare triple {1199#false} assume 0 == __VERIFIER_assert_~cond; {1199#false} is VALID [2021-09-13 14:27:00,161 INFO L281 TraceCheckUtils]: 17: Hoare triple {1199#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1199#false} is VALID [2021-09-13 14:27:00,161 INFO L281 TraceCheckUtils]: 16: Hoare triple {1249#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {1199#false} is VALID [2021-09-13 14:27:00,161 INFO L281 TraceCheckUtils]: 15: Hoare triple {1249#(<= 1 ULTIMATE.start_main_~b~0)} assume !false; {1249#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:00,162 INFO L281 TraceCheckUtils]: 14: Hoare triple {1239#(<= 1 ULTIMATE.start_main_~c~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {1249#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:00,162 INFO L281 TraceCheckUtils]: 13: Hoare triple {1239#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {1239#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:00,162 INFO L281 TraceCheckUtils]: 12: Hoare triple {1239#(<= 1 ULTIMATE.start_main_~c~0)} assume !false; {1239#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:00,163 INFO L281 TraceCheckUtils]: 11: Hoare triple {1232#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {1239#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:00,163 INFO L281 TraceCheckUtils]: 10: Hoare triple {1232#(<= 1 ULTIMATE.start_main_~a~0)} assume !false; {1232#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:00,163 INFO L281 TraceCheckUtils]: 9: Hoare triple {1222#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {1232#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:00,164 INFO L281 TraceCheckUtils]: 8: Hoare triple {1222#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {1222#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:00,164 INFO L281 TraceCheckUtils]: 7: Hoare triple {1222#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1222#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:00,164 INFO L281 TraceCheckUtils]: 6: Hoare triple {1304#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {1222#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:00,165 INFO L281 TraceCheckUtils]: 5: Hoare triple {1198#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1304#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:00,165 INFO L281 TraceCheckUtils]: 4: Hoare triple {1198#true} assume !(0 == assume_abort_if_not_~cond); {1198#true} is VALID [2021-09-13 14:27:00,165 INFO L281 TraceCheckUtils]: 3: Hoare triple {1198#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1198#true} is VALID [2021-09-13 14:27:00,165 INFO L281 TraceCheckUtils]: 2: Hoare triple {1198#true} assume !(0 == assume_abort_if_not_~cond); {1198#true} is VALID [2021-09-13 14:27:00,165 INFO L281 TraceCheckUtils]: 1: Hoare triple {1198#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1198#true} is VALID [2021-09-13 14:27:00,165 INFO L281 TraceCheckUtils]: 0: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1198#true} is VALID [2021-09-13 14:27:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:00,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:00,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22077593] [2021-09-13 14:27:00,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:00,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601010805] [2021-09-13 14:27:00,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601010805] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:00,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:00,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-09-13 14:27:00,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845240886] [2021-09-13 14:27:00,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 14:27:00,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:00,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:00,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:27:00,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:00,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:27:00,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:27:00,178 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:00,684 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2021-09-13 14:27:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:27:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 14:27:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2021-09-13 14:27:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2021-09-13 14:27:00,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 123 transitions. [2021-09-13 14:27:00,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:00,772 INFO L225 Difference]: With dead ends: 140 [2021-09-13 14:27:00,773 INFO L226 Difference]: Without dead ends: 136 [2021-09-13 14:27:00,773 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 81.13ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:27:00,773 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 162.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.87ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 163.95ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:00,774 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 283 Unknown, 0 Unchecked, 1.87ms Time], IncrementalHoareTripleChecker [11 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 163.95ms Time] [2021-09-13 14:27:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-09-13 14:27:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2021-09-13 14:27:00,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:00,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,857 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,857 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:00,859 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2021-09-13 14:27:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2021-09-13 14:27:00,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:00,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:00,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 136 states. [2021-09-13 14:27:00,861 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 136 states. [2021-09-13 14:27:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:00,865 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2021-09-13 14:27:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2021-09-13 14:27:00,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:00,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:00,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:00,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2021-09-13 14:27:00,867 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 20 [2021-09-13 14:27:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:00,868 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2021-09-13 14:27:00,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2021-09-13 14:27:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-13 14:27:00,868 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:00,868 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:00,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:27:01,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:01,087 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1264867958, now seen corresponding path program 1 times [2021-09-13 14:27:01,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:01,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143025629] [2021-09-13 14:27:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:01,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:01,096 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:01,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844772197] [2021-09-13 14:27:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:01,096 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:01,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:01,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:27:01,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:27:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:01,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:27:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:01,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:01,452 INFO L281 TraceCheckUtils]: 0: Hoare triple {1885#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1885#true} is VALID [2021-09-13 14:27:01,453 INFO L281 TraceCheckUtils]: 1: Hoare triple {1885#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1885#true} is VALID [2021-09-13 14:27:01,453 INFO L281 TraceCheckUtils]: 2: Hoare triple {1885#true} assume !(0 == assume_abort_if_not_~cond); {1885#true} is VALID [2021-09-13 14:27:01,455 INFO L281 TraceCheckUtils]: 3: Hoare triple {1885#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1899#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:27:01,456 INFO L281 TraceCheckUtils]: 4: Hoare triple {1899#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:01,456 INFO L281 TraceCheckUtils]: 5: Hoare triple {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:01,457 INFO L281 TraceCheckUtils]: 6: Hoare triple {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:01,457 INFO L281 TraceCheckUtils]: 7: Hoare triple {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:01,458 INFO L281 TraceCheckUtils]: 8: Hoare triple {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:01,458 INFO L281 TraceCheckUtils]: 9: Hoare triple {1903#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {1919#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:01,459 INFO L281 TraceCheckUtils]: 10: Hoare triple {1919#(<= 0 ULTIMATE.start_main_~b~0)} assume !false; {1919#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:01,459 INFO L281 TraceCheckUtils]: 11: Hoare triple {1919#(<= 0 ULTIMATE.start_main_~b~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:01,460 INFO L281 TraceCheckUtils]: 12: Hoare triple {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !false; {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:01,461 INFO L281 TraceCheckUtils]: 13: Hoare triple {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:01,462 INFO L281 TraceCheckUtils]: 14: Hoare triple {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:01,472 INFO L281 TraceCheckUtils]: 15: Hoare triple {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:01,474 INFO L281 TraceCheckUtils]: 16: Hoare triple {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:01,475 INFO L281 TraceCheckUtils]: 17: Hoare triple {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:01,475 INFO L281 TraceCheckUtils]: 18: Hoare triple {1926#(and (= ULTIMATE.start_main_~k~0 0) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1948#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:01,475 INFO L281 TraceCheckUtils]: 19: Hoare triple {1948#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1886#false} is VALID [2021-09-13 14:27:01,475 INFO L281 TraceCheckUtils]: 20: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2021-09-13 14:27:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:01,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:01,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:01,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143025629] [2021-09-13 14:27:01,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:01,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844772197] [2021-09-13 14:27:01,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844772197] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:01,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:01,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:27:01,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46037600] [2021-09-13 14:27:01,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:27:01,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:01,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:01,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:01,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:27:01,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:27:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:27:01,492 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:01,918 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2021-09-13 14:27:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:27:01,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:27:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2021-09-13 14:27:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2021-09-13 14:27:01,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2021-09-13 14:27:01,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:01,977 INFO L225 Difference]: With dead ends: 95 [2021-09-13 14:27:01,977 INFO L226 Difference]: Without dead ends: 93 [2021-09-13 14:27:01,977 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 79.24ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:27:01,978 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.18ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 124.16ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:01,978 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 192 Unknown, 0 Unchecked, 1.18ms Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 124.16ms Time] [2021-09-13 14:27:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-09-13 14:27:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2021-09-13 14:27:02,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:02,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:02,091 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:02,091 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:02,093 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2021-09-13 14:27:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-09-13 14:27:02,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:02,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:02,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2021-09-13 14:27:02,093 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2021-09-13 14:27:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:02,095 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2021-09-13 14:27:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-09-13 14:27:02,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:02,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:02,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:02,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2021-09-13 14:27:02,098 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 21 [2021-09-13 14:27:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:02,098 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2021-09-13 14:27:02,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2021-09-13 14:27:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:27:02,099 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:02,099 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:02,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:27:02,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:02,313 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash 94063923, now seen corresponding path program 1 times [2021-09-13 14:27:02,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:02,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421665080] [2021-09-13 14:27:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:02,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:02,322 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:02,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878498916] [2021-09-13 14:27:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:02,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:02,324 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) [2021-09-13 14:27:02,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-09-13 14:27:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:02,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2021-09-13 14:27:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:02,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:03,064 INFO L281 TraceCheckUtils]: 0: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2387#true} is VALID [2021-09-13 14:27:03,065 INFO L281 TraceCheckUtils]: 1: Hoare triple {2387#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2387#true} is VALID [2021-09-13 14:27:03,065 INFO L281 TraceCheckUtils]: 2: Hoare triple {2387#true} assume !(0 == assume_abort_if_not_~cond); {2387#true} is VALID [2021-09-13 14:27:03,066 INFO L281 TraceCheckUtils]: 3: Hoare triple {2387#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2401#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:27:03,066 INFO L281 TraceCheckUtils]: 4: Hoare triple {2401#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {2405#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,067 INFO L281 TraceCheckUtils]: 5: Hoare triple {2405#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2409#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))))} is VALID [2021-09-13 14:27:03,067 INFO L281 TraceCheckUtils]: 6: Hoare triple {2409#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))))} assume !(0 == assume_abort_if_not_~cond); {2413#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,068 INFO L281 TraceCheckUtils]: 7: Hoare triple {2413#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2413#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,068 INFO L281 TraceCheckUtils]: 8: Hoare triple {2413#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {2413#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,069 INFO L281 TraceCheckUtils]: 9: Hoare triple {2413#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {2423#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,069 INFO L281 TraceCheckUtils]: 10: Hoare triple {2423#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {2423#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,070 INFO L281 TraceCheckUtils]: 11: Hoare triple {2423#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {2430#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,070 INFO L281 TraceCheckUtils]: 12: Hoare triple {2430#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {2430#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,071 INFO L281 TraceCheckUtils]: 13: Hoare triple {2430#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {2437#(and (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,072 INFO L281 TraceCheckUtils]: 14: Hoare triple {2437#(and (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,072 INFO L281 TraceCheckUtils]: 15: Hoare triple {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !false; {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,073 INFO L281 TraceCheckUtils]: 16: Hoare triple {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,073 INFO L281 TraceCheckUtils]: 17: Hoare triple {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !false; {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,073 INFO L281 TraceCheckUtils]: 18: Hoare triple {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,074 INFO L281 TraceCheckUtils]: 19: Hoare triple {2441#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (<= ULTIMATE.start_main_~y~0 5) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2457#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:03,074 INFO L281 TraceCheckUtils]: 20: Hoare triple {2457#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2388#false} is VALID [2021-09-13 14:27:03,074 INFO L281 TraceCheckUtils]: 21: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2021-09-13 14:27:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:03,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:03,324 INFO L281 TraceCheckUtils]: 21: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2021-09-13 14:27:03,325 INFO L281 TraceCheckUtils]: 20: Hoare triple {2457#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2388#false} is VALID [2021-09-13 14:27:03,325 INFO L281 TraceCheckUtils]: 19: Hoare triple {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2457#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:03,326 INFO L281 TraceCheckUtils]: 18: Hoare triple {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:27:03,326 INFO L281 TraceCheckUtils]: 17: Hoare triple {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false; {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:27:03,326 INFO L281 TraceCheckUtils]: 16: Hoare triple {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:27:03,327 INFO L281 TraceCheckUtils]: 15: Hoare triple {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false; {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:27:03,327 INFO L281 TraceCheckUtils]: 14: Hoare triple {2486#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {2470#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:27:03,328 INFO L281 TraceCheckUtils]: 13: Hoare triple {2490#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0))} assume !(main_~c~0 >= main_~b~0); {2486#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:03,328 INFO L281 TraceCheckUtils]: 12: Hoare triple {2490#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0))} assume !false; {2490#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:03,329 INFO L281 TraceCheckUtils]: 11: Hoare triple {2497#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {2490#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:03,329 INFO L281 TraceCheckUtils]: 10: Hoare triple {2497#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0))} assume !false; {2497#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:27:03,329 INFO L281 TraceCheckUtils]: 9: Hoare triple {2387#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {2497#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:27:03,330 INFO L281 TraceCheckUtils]: 8: Hoare triple {2387#true} assume !(0 == assume_abort_if_not_~cond); {2387#true} is VALID [2021-09-13 14:27:03,330 INFO L281 TraceCheckUtils]: 7: Hoare triple {2387#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2387#true} is VALID [2021-09-13 14:27:03,330 INFO L281 TraceCheckUtils]: 6: Hoare triple {2387#true} assume !(0 == assume_abort_if_not_~cond); {2387#true} is VALID [2021-09-13 14:27:03,330 INFO L281 TraceCheckUtils]: 5: Hoare triple {2387#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2387#true} is VALID [2021-09-13 14:27:03,330 INFO L281 TraceCheckUtils]: 4: Hoare triple {2387#true} assume !(0 == assume_abort_if_not_~cond); {2387#true} is VALID [2021-09-13 14:27:03,330 INFO L281 TraceCheckUtils]: 3: Hoare triple {2387#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2387#true} is VALID [2021-09-13 14:27:03,330 INFO L281 TraceCheckUtils]: 2: Hoare triple {2387#true} assume !(0 == assume_abort_if_not_~cond); {2387#true} is VALID [2021-09-13 14:27:03,331 INFO L281 TraceCheckUtils]: 1: Hoare triple {2387#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2387#true} is VALID [2021-09-13 14:27:03,331 INFO L281 TraceCheckUtils]: 0: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2387#true} is VALID [2021-09-13 14:27:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:03,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:03,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421665080] [2021-09-13 14:27:03,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:03,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878498916] [2021-09-13 14:27:03,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878498916] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:03,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:03,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2021-09-13 14:27:03,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718039402] [2021-09-13 14:27:03,332 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-09-13 14:27:03,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:03,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:03,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:03,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-13 14:27:03,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-13 14:27:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:27:03,363 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:06,789 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2021-09-13 14:27:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-09-13 14:27:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-09-13 14:27:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2021-09-13 14:27:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2021-09-13 14:27:06,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 130 transitions. [2021-09-13 14:27:06,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:06,901 INFO L225 Difference]: With dead ends: 144 [2021-09-13 14:27:06,901 INFO L226 Difference]: Without dead ends: 142 [2021-09-13 14:27:06,902 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 837.73ms TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2021-09-13 14:27:06,905 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1424.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.48ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1429.22ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:06,906 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 578 Unknown, 0 Unchecked, 3.48ms Time], IncrementalHoareTripleChecker [40 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1429.22ms Time] [2021-09-13 14:27:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-09-13 14:27:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2021-09-13 14:27:07,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:07,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 116 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:07,124 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 116 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:07,125 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 116 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:07,127 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2021-09-13 14:27:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2021-09-13 14:27:07,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:07,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:07,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 142 states. [2021-09-13 14:27:07,128 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 142 states. [2021-09-13 14:27:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:07,130 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2021-09-13 14:27:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2021-09-13 14:27:07,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:07,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:07,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:07,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 146 transitions. [2021-09-13 14:27:07,134 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 146 transitions. Word has length 22 [2021-09-13 14:27:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:07,134 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 146 transitions. [2021-09-13 14:27:07,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 146 transitions. [2021-09-13 14:27:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:27:07,134 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:07,135 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:07,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-09-13 14:27:07,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:07,345 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash 62520889, now seen corresponding path program 1 times [2021-09-13 14:27:07,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:07,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819892857] [2021-09-13 14:27:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:07,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:07,362 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:07,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628773246] [2021-09-13 14:27:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:07,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:07,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:07,364 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) [2021-09-13 14:27:07,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-09-13 14:27:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:07,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:27:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:07,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:07,555 INFO L281 TraceCheckUtils]: 0: Hoare triple {3190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 1: Hoare triple {3190#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 2: Hoare triple {3190#true} assume !(0 == assume_abort_if_not_~cond); {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 3: Hoare triple {3190#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 4: Hoare triple {3190#true} assume !(0 == assume_abort_if_not_~cond); {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 5: Hoare triple {3190#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 6: Hoare triple {3190#true} assume !(0 == assume_abort_if_not_~cond); {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 7: Hoare triple {3190#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 8: Hoare triple {3190#true} assume !(0 == assume_abort_if_not_~cond); {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 9: Hoare triple {3190#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {3190#true} is VALID [2021-09-13 14:27:07,556 INFO L281 TraceCheckUtils]: 10: Hoare triple {3190#true} assume !false; {3190#true} is VALID [2021-09-13 14:27:07,557 INFO L281 TraceCheckUtils]: 11: Hoare triple {3190#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {3190#true} is VALID [2021-09-13 14:27:07,557 INFO L281 TraceCheckUtils]: 12: Hoare triple {3190#true} assume !false; {3190#true} is VALID [2021-09-13 14:27:07,557 INFO L281 TraceCheckUtils]: 13: Hoare triple {3190#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:07,558 INFO L281 TraceCheckUtils]: 14: Hoare triple {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:07,558 INFO L281 TraceCheckUtils]: 15: Hoare triple {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:07,558 INFO L281 TraceCheckUtils]: 16: Hoare triple {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:07,559 INFO L281 TraceCheckUtils]: 17: Hoare triple {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:07,559 INFO L281 TraceCheckUtils]: 18: Hoare triple {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:07,560 INFO L281 TraceCheckUtils]: 19: Hoare triple {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:07,560 INFO L281 TraceCheckUtils]: 20: Hoare triple {3234#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3256#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:07,561 INFO L281 TraceCheckUtils]: 21: Hoare triple {3256#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {3191#false} is VALID [2021-09-13 14:27:07,561 INFO L281 TraceCheckUtils]: 22: Hoare triple {3191#false} assume !false; {3191#false} is VALID [2021-09-13 14:27:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:07,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:07,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:07,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819892857] [2021-09-13 14:27:07,561 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:07,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628773246] [2021-09-13 14:27:07,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628773246] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:07,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:07,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:27:07,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102897444] [2021-09-13 14:27:07,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-09-13 14:27:07,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:07,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:07,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:07,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:27:07,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:27:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:27:07,578 INFO L87 Difference]: Start difference. First operand 116 states and 146 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:08,240 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2021-09-13 14:27:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:27:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-09-13 14:27:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2021-09-13 14:27:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2021-09-13 14:27:08,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2021-09-13 14:27:08,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:08,296 INFO L225 Difference]: With dead ends: 226 [2021-09-13 14:27:08,297 INFO L226 Difference]: Without dead ends: 224 [2021-09-13 14:27:08,297 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.95ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:27:08,297 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.72ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.12ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:08,298 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 134 Unknown, 0 Unchecked, 0.72ms Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 84.12ms Time] [2021-09-13 14:27:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-09-13 14:27:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 164. [2021-09-13 14:27:08,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:08,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 164 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 163 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,639 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 164 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 163 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,639 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 164 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 163 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:08,643 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2021-09-13 14:27:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2021-09-13 14:27:08,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:08,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:08,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 163 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 224 states. [2021-09-13 14:27:08,645 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 163 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 224 states. [2021-09-13 14:27:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:08,649 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2021-09-13 14:27:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2021-09-13 14:27:08,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:08,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:08,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:08,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 163 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 205 transitions. [2021-09-13 14:27:08,653 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 205 transitions. Word has length 23 [2021-09-13 14:27:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:08,653 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 205 transitions. [2021-09-13 14:27:08,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 205 transitions. [2021-09-13 14:27:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 14:27:08,654 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:08,654 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:08,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:27:08,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:08,863 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 201274102, now seen corresponding path program 1 times [2021-09-13 14:27:08,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:08,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553231998] [2021-09-13 14:27:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:08,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:08,872 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:08,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938874006] [2021-09-13 14:27:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:08,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:08,873 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) [2021-09-13 14:27:08,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-09-13 14:27:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:08,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2021-09-13 14:27:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:08,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:09,292 INFO L281 TraceCheckUtils]: 0: Hoare triple {4271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {4271#true} is VALID [2021-09-13 14:27:09,293 INFO L281 TraceCheckUtils]: 1: Hoare triple {4271#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:27:09,293 INFO L281 TraceCheckUtils]: 2: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:27:09,293 INFO L281 TraceCheckUtils]: 3: Hoare triple {4271#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:27:09,293 INFO L281 TraceCheckUtils]: 4: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:27:09,293 INFO L281 TraceCheckUtils]: 5: Hoare triple {4271#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:27:09,293 INFO L281 TraceCheckUtils]: 6: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:27:09,294 INFO L281 TraceCheckUtils]: 7: Hoare triple {4271#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:27:09,294 INFO L281 TraceCheckUtils]: 8: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:27:09,294 INFO L281 TraceCheckUtils]: 9: Hoare triple {4271#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {4303#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:27:09,295 INFO L281 TraceCheckUtils]: 10: Hoare triple {4303#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !false; {4303#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:27:09,298 INFO L281 TraceCheckUtils]: 11: Hoare triple {4303#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {4310#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:27:09,299 INFO L281 TraceCheckUtils]: 12: Hoare triple {4310#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !false; {4310#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:27:09,299 INFO L281 TraceCheckUtils]: 13: Hoare triple {4310#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(main_~c~0 >= main_~b~0); {4310#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:27:09,300 INFO L281 TraceCheckUtils]: 14: Hoare triple {4310#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:27:09,300 INFO L281 TraceCheckUtils]: 15: Hoare triple {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !false; {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:27:09,301 INFO L281 TraceCheckUtils]: 16: Hoare triple {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:27:09,301 INFO L281 TraceCheckUtils]: 17: Hoare triple {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !false; {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:27:09,302 INFO L281 TraceCheckUtils]: 18: Hoare triple {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:27:09,302 INFO L281 TraceCheckUtils]: 19: Hoare triple {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:27:09,303 INFO L281 TraceCheckUtils]: 20: Hoare triple {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:27:09,303 INFO L281 TraceCheckUtils]: 21: Hoare triple {4320#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4342#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:09,303 INFO L281 TraceCheckUtils]: 22: Hoare triple {4342#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {4272#false} is VALID [2021-09-13 14:27:09,304 INFO L281 TraceCheckUtils]: 23: Hoare triple {4272#false} assume !false; {4272#false} is VALID [2021-09-13 14:27:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:09,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:31:34,598 INFO L281 TraceCheckUtils]: 23: Hoare triple {4272#false} assume !false; {4272#false} is VALID [2021-09-13 14:31:34,598 INFO L281 TraceCheckUtils]: 22: Hoare triple {4342#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {4272#false} is VALID [2021-09-13 14:31:34,599 INFO L281 TraceCheckUtils]: 21: Hoare triple {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4342#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:31:34,599 INFO L281 TraceCheckUtils]: 20: Hoare triple {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} assume !(0 == __VERIFIER_assert_~cond); {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:34,600 INFO L281 TraceCheckUtils]: 19: Hoare triple {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:34,600 INFO L281 TraceCheckUtils]: 18: Hoare triple {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:34,600 INFO L281 TraceCheckUtils]: 17: Hoare triple {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} assume !false; {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:34,601 INFO L281 TraceCheckUtils]: 16: Hoare triple {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:34,601 INFO L281 TraceCheckUtils]: 15: Hoare triple {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} assume !false; {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:34,616 INFO L281 TraceCheckUtils]: 14: Hoare triple {4377#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {4355#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:34,621 INFO L281 TraceCheckUtils]: 13: Hoare triple {4377#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !(main_~c~0 >= main_~b~0); {4377#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:34,622 INFO L281 TraceCheckUtils]: 12: Hoare triple {4377#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !false; {4377#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:34,622 INFO L281 TraceCheckUtils]: 11: Hoare triple {4387#(forall ((ULTIMATE.start_main_~y~0 Int)) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {4377#(forall ((ULTIMATE.start_main_~y~0 Int)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:34,623 INFO L281 TraceCheckUtils]: 10: Hoare triple {4387#(forall ((ULTIMATE.start_main_~y~0 Int)) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !false; {4387#(forall ((ULTIMATE.start_main_~y~0 Int)) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:34,623 INFO L281 TraceCheckUtils]: 9: Hoare triple {4271#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {4387#(forall ((ULTIMATE.start_main_~y~0 Int)) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:34,623 INFO L281 TraceCheckUtils]: 8: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:31:34,623 INFO L281 TraceCheckUtils]: 7: Hoare triple {4271#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:31:34,623 INFO L281 TraceCheckUtils]: 6: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:31:34,624 INFO L281 TraceCheckUtils]: 5: Hoare triple {4271#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:31:34,624 INFO L281 TraceCheckUtils]: 4: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:31:34,624 INFO L281 TraceCheckUtils]: 3: Hoare triple {4271#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:31:34,624 INFO L281 TraceCheckUtils]: 2: Hoare triple {4271#true} assume !(0 == assume_abort_if_not_~cond); {4271#true} is VALID [2021-09-13 14:31:34,624 INFO L281 TraceCheckUtils]: 1: Hoare triple {4271#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4271#true} is VALID [2021-09-13 14:31:34,624 INFO L281 TraceCheckUtils]: 0: Hoare triple {4271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {4271#true} is VALID [2021-09-13 14:31:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:31:34,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:31:34,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553231998] [2021-09-13 14:31:34,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:31:34,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938874006] [2021-09-13 14:31:34,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938874006] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:31:34,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:31:34,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:31:34,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842616524] [2021-09-13 14:31:34,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-09-13 14:31:34,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:34,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:34,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:34,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:31:34,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:31:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:31:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:31:34,667 INFO L87 Difference]: Start difference. First operand 164 states and 205 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:35,322 INFO L93 Difference]: Finished difference Result 175 states and 212 transitions. [2021-09-13 14:31:35,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:31:35,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-09-13 14:31:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:31:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2021-09-13 14:31:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2021-09-13 14:31:35,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2021-09-13 14:31:35,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:35,383 INFO L225 Difference]: With dead ends: 175 [2021-09-13 14:31:35,383 INFO L226 Difference]: Without dead ends: 173 [2021-09-13 14:31:35,383 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 122.16ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:31:35,384 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.73ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 121.76ms IncrementalHoareTripleChecker+Time [2021-09-13 14:31:35,384 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 394 Unknown, 0 Unchecked, 1.73ms Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 194 Unchecked, 121.76ms Time] [2021-09-13 14:31:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-09-13 14:31:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2021-09-13 14:31:35,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:31:35,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 164 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 163 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,779 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 164 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 163 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,779 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 164 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 163 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:35,783 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2021-09-13 14:31:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2021-09-13 14:31:35,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:35,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:35,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 163 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 173 states. [2021-09-13 14:31:35,784 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 163 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 173 states. [2021-09-13 14:31:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:35,788 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2021-09-13 14:31:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2021-09-13 14:31:35,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:35,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:35,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:31:35,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:31:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 163 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 203 transitions. [2021-09-13 14:31:35,794 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 203 transitions. Word has length 24 [2021-09-13 14:31:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:31:35,794 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 203 transitions. [2021-09-13 14:31:35,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 203 transitions. [2021-09-13 14:31:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-09-13 14:31:35,795 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:31:35,796 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:31:35,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-09-13 14:31:36,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-09-13 14:31:36,001 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:31:36,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:31:36,001 INFO L82 PathProgramCache]: Analyzing trace with hash 151041369, now seen corresponding path program 1 times [2021-09-13 14:31:36,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:31:36,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153532277] [2021-09-13 14:31:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:36,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:31:36,011 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:31:36,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445926937] [2021-09-13 14:31:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:36,012 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:31:36,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:31:36,017 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) [2021-09-13 14:31:36,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-09-13 14:31:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:36,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:31:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:36,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:31:36,386 INFO L281 TraceCheckUtils]: 0: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {5249#true} is VALID [2021-09-13 14:31:36,386 INFO L281 TraceCheckUtils]: 1: Hoare triple {5249#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5249#true} is VALID [2021-09-13 14:31:36,386 INFO L281 TraceCheckUtils]: 2: Hoare triple {5249#true} assume !(0 == assume_abort_if_not_~cond); {5249#true} is VALID [2021-09-13 14:31:36,386 INFO L281 TraceCheckUtils]: 3: Hoare triple {5249#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5249#true} is VALID [2021-09-13 14:31:36,386 INFO L281 TraceCheckUtils]: 4: Hoare triple {5249#true} assume !(0 == assume_abort_if_not_~cond); {5249#true} is VALID [2021-09-13 14:31:36,391 INFO L281 TraceCheckUtils]: 5: Hoare triple {5249#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5269#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} is VALID [2021-09-13 14:31:36,392 INFO L281 TraceCheckUtils]: 6: Hoare triple {5269#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} assume !(0 == assume_abort_if_not_~cond); {5273#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:31:36,394 INFO L281 TraceCheckUtils]: 7: Hoare triple {5273#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5273#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:31:36,394 INFO L281 TraceCheckUtils]: 8: Hoare triple {5273#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {5273#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:31:36,394 INFO L281 TraceCheckUtils]: 9: Hoare triple {5273#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {5283#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,395 INFO L281 TraceCheckUtils]: 10: Hoare triple {5283#(<= 1 ULTIMATE.start_main_~a~0)} assume !false; {5283#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,395 INFO L281 TraceCheckUtils]: 11: Hoare triple {5283#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5290#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:31:36,396 INFO L281 TraceCheckUtils]: 12: Hoare triple {5290#(<= 1 ULTIMATE.start_main_~c~0)} assume !false; {5290#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:31:36,396 INFO L281 TraceCheckUtils]: 13: Hoare triple {5290#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {5290#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:31:36,399 INFO L281 TraceCheckUtils]: 14: Hoare triple {5290#(<= 1 ULTIMATE.start_main_~c~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {5300#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:31:36,400 INFO L281 TraceCheckUtils]: 15: Hoare triple {5300#(<= 1 ULTIMATE.start_main_~b~0)} assume !false; {5300#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:31:36,400 INFO L281 TraceCheckUtils]: 16: Hoare triple {5300#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:36,400 INFO L281 TraceCheckUtils]: 17: Hoare triple {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !false; {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:36,401 INFO L281 TraceCheckUtils]: 18: Hoare triple {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:36,401 INFO L281 TraceCheckUtils]: 19: Hoare triple {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:36,401 INFO L281 TraceCheckUtils]: 20: Hoare triple {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:36,402 INFO L281 TraceCheckUtils]: 21: Hoare triple {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:36,402 INFO L281 TraceCheckUtils]: 22: Hoare triple {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:36,403 INFO L281 TraceCheckUtils]: 23: Hoare triple {5307#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5329#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:31:36,403 INFO L281 TraceCheckUtils]: 24: Hoare triple {5329#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5250#false} is VALID [2021-09-13 14:31:36,403 INFO L281 TraceCheckUtils]: 25: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2021-09-13 14:31:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:31:36,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:31:36,544 INFO L281 TraceCheckUtils]: 25: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2021-09-13 14:31:36,544 INFO L281 TraceCheckUtils]: 24: Hoare triple {5329#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5250#false} is VALID [2021-09-13 14:31:36,545 INFO L281 TraceCheckUtils]: 23: Hoare triple {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5329#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:31:36,546 INFO L281 TraceCheckUtils]: 22: Hoare triple {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} assume !(0 == __VERIFIER_assert_~cond); {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,546 INFO L281 TraceCheckUtils]: 21: Hoare triple {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,547 INFO L281 TraceCheckUtils]: 20: Hoare triple {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} assume !(0 == __VERIFIER_assert_~cond); {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,547 INFO L281 TraceCheckUtils]: 19: Hoare triple {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,547 INFO L281 TraceCheckUtils]: 18: Hoare triple {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,547 INFO L281 TraceCheckUtils]: 17: Hoare triple {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} assume !false; {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 16: Hoare triple {5249#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5342#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 15: Hoare triple {5249#true} assume !false; {5249#true} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 14: Hoare triple {5249#true} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {5249#true} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 13: Hoare triple {5249#true} assume !(main_~c~0 >= main_~b~0); {5249#true} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 12: Hoare triple {5249#true} assume !false; {5249#true} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 11: Hoare triple {5249#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5249#true} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 10: Hoare triple {5249#true} assume !false; {5249#true} is VALID [2021-09-13 14:31:36,548 INFO L281 TraceCheckUtils]: 9: Hoare triple {5249#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 8: Hoare triple {5249#true} assume !(0 == assume_abort_if_not_~cond); {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 7: Hoare triple {5249#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 6: Hoare triple {5249#true} assume !(0 == assume_abort_if_not_~cond); {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 5: Hoare triple {5249#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 4: Hoare triple {5249#true} assume !(0 == assume_abort_if_not_~cond); {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 3: Hoare triple {5249#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 2: Hoare triple {5249#true} assume !(0 == assume_abort_if_not_~cond); {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 1: Hoare triple {5249#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5249#true} is VALID [2021-09-13 14:31:36,549 INFO L281 TraceCheckUtils]: 0: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {5249#true} is VALID [2021-09-13 14:31:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:31:36,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:31:36,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153532277] [2021-09-13 14:31:36,550 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:31:36,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445926937] [2021-09-13 14:31:36,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445926937] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:31:36,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:31:36,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2021-09-13 14:31:36,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314994445] [2021-09-13 14:31:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-09-13 14:31:36,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:36,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:36,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:36,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:31:36,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:31:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:31:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:31:36,568 INFO L87 Difference]: Start difference. First operand 164 states and 203 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:37,326 INFO L93 Difference]: Finished difference Result 250 states and 313 transitions. [2021-09-13 14:31:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:31:37,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-09-13 14:31:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:31:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2021-09-13 14:31:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2021-09-13 14:31:37,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2021-09-13 14:31:37,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:37,367 INFO L225 Difference]: With dead ends: 250 [2021-09-13 14:31:37,367 INFO L226 Difference]: Without dead ends: 248 [2021-09-13 14:31:37,367 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 61.40ms TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:31:37,368 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:31:37,368 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 66.35ms Time] [2021-09-13 14:31:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-09-13 14:31:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2021-09-13 14:31:37,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:31:37,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 236 states, 231 states have (on average 1.277056277056277) internal successors, (295), 235 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,985 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 236 states, 231 states have (on average 1.277056277056277) internal successors, (295), 235 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,986 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 236 states, 231 states have (on average 1.277056277056277) internal successors, (295), 235 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:37,989 INFO L93 Difference]: Finished difference Result 248 states and 304 transitions. [2021-09-13 14:31:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 304 transitions. [2021-09-13 14:31:37,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:37,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:37,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 231 states have (on average 1.277056277056277) internal successors, (295), 235 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 248 states. [2021-09-13 14:31:37,990 INFO L87 Difference]: Start difference. First operand has 236 states, 231 states have (on average 1.277056277056277) internal successors, (295), 235 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 248 states. [2021-09-13 14:31:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:37,994 INFO L93 Difference]: Finished difference Result 248 states and 304 transitions. [2021-09-13 14:31:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 304 transitions. [2021-09-13 14:31:37,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:37,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:37,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:31:37,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:31:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.277056277056277) internal successors, (295), 235 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 295 transitions. [2021-09-13 14:31:37,999 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 295 transitions. Word has length 26 [2021-09-13 14:31:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:31:37,999 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 295 transitions. [2021-09-13 14:31:37,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 295 transitions. [2021-09-13 14:31:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-09-13 14:31:38,000 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:31:38,000 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:31:38,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-09-13 14:31:38,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-09-13 14:31:38,217 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:31:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:31:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash -74821968, now seen corresponding path program 2 times [2021-09-13 14:31:38,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:31:38,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201877172] [2021-09-13 14:31:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:38,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:31:38,227 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:31:38,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068827818] [2021-09-13 14:31:38,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:31:38,227 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:31:38,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:31:38,233 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:31:38,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-09-13 14:31:38,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:31:38,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:31:38,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:31:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:38,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:31:38,380 INFO L281 TraceCheckUtils]: 0: Hoare triple {6609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {6609#true} is VALID [2021-09-13 14:31:38,381 INFO L281 TraceCheckUtils]: 1: Hoare triple {6609#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6609#true} is VALID [2021-09-13 14:31:38,381 INFO L281 TraceCheckUtils]: 2: Hoare triple {6609#true} assume !(0 == assume_abort_if_not_~cond); {6609#true} is VALID [2021-09-13 14:31:38,381 INFO L281 TraceCheckUtils]: 3: Hoare triple {6609#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6609#true} is VALID [2021-09-13 14:31:38,381 INFO L281 TraceCheckUtils]: 4: Hoare triple {6609#true} assume !(0 == assume_abort_if_not_~cond); {6609#true} is VALID [2021-09-13 14:31:38,381 INFO L281 TraceCheckUtils]: 5: Hoare triple {6609#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6609#true} is VALID [2021-09-13 14:31:38,381 INFO L281 TraceCheckUtils]: 6: Hoare triple {6609#true} assume !(0 == assume_abort_if_not_~cond); {6609#true} is VALID [2021-09-13 14:31:38,381 INFO L281 TraceCheckUtils]: 7: Hoare triple {6609#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6609#true} is VALID [2021-09-13 14:31:38,382 INFO L281 TraceCheckUtils]: 8: Hoare triple {6609#true} assume !(0 == assume_abort_if_not_~cond); {6609#true} is VALID [2021-09-13 14:31:38,382 INFO L281 TraceCheckUtils]: 9: Hoare triple {6609#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {6609#true} is VALID [2021-09-13 14:31:38,382 INFO L281 TraceCheckUtils]: 10: Hoare triple {6609#true} assume !false; {6609#true} is VALID [2021-09-13 14:31:38,382 INFO L281 TraceCheckUtils]: 11: Hoare triple {6609#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {6609#true} is VALID [2021-09-13 14:31:38,382 INFO L281 TraceCheckUtils]: 12: Hoare triple {6609#true} assume !false; {6609#true} is VALID [2021-09-13 14:31:38,382 INFO L281 TraceCheckUtils]: 13: Hoare triple {6609#true} assume !(main_~c~0 >= main_~b~0); {6653#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:31:38,383 INFO L281 TraceCheckUtils]: 14: Hoare triple {6653#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {6657#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:38,383 INFO L281 TraceCheckUtils]: 15: Hoare triple {6657#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !false; {6657#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:31:38,384 INFO L281 TraceCheckUtils]: 16: Hoare triple {6657#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {6664#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:31:38,384 INFO L281 TraceCheckUtils]: 17: Hoare triple {6664#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !false; {6664#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:31:38,385 INFO L281 TraceCheckUtils]: 18: Hoare triple {6664#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {6610#false} is VALID [2021-09-13 14:31:38,385 INFO L281 TraceCheckUtils]: 19: Hoare triple {6610#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {6610#false} is VALID [2021-09-13 14:31:38,385 INFO L281 TraceCheckUtils]: 20: Hoare triple {6610#false} assume !false; {6610#false} is VALID [2021-09-13 14:31:38,385 INFO L281 TraceCheckUtils]: 21: Hoare triple {6610#false} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {6610#false} is VALID [2021-09-13 14:31:38,385 INFO L281 TraceCheckUtils]: 22: Hoare triple {6610#false} assume !false; {6610#false} is VALID [2021-09-13 14:31:38,385 INFO L281 TraceCheckUtils]: 23: Hoare triple {6610#false} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {6610#false} is VALID [2021-09-13 14:31:38,385 INFO L281 TraceCheckUtils]: 24: Hoare triple {6610#false} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6610#false} is VALID [2021-09-13 14:31:38,386 INFO L281 TraceCheckUtils]: 25: Hoare triple {6610#false} assume 0 == __VERIFIER_assert_~cond; {6610#false} is VALID [2021-09-13 14:31:38,386 INFO L281 TraceCheckUtils]: 26: Hoare triple {6610#false} assume !false; {6610#false} is VALID [2021-09-13 14:31:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:31:38,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:31:38,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:31:38,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201877172] [2021-09-13 14:31:38,386 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:31:38,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068827818] [2021-09-13 14:31:38,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068827818] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:31:38,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:31:38,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:31:38,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352743330] [2021-09-13 14:31:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-09-13 14:31:38,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:38,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:38,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:38,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:31:38,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:31:38,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:31:38,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:31:38,408 INFO L87 Difference]: Start difference. First operand 236 states and 295 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:39,177 INFO L93 Difference]: Finished difference Result 308 states and 376 transitions. [2021-09-13 14:31:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:31:39,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-09-13 14:31:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:31:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2021-09-13 14:31:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2021-09-13 14:31:39,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2021-09-13 14:31:39,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:39,255 INFO L225 Difference]: With dead ends: 308 [2021-09-13 14:31:39,255 INFO L226 Difference]: Without dead ends: 207 [2021-09-13 14:31:39,256 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.46ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:31:39,256 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.32ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 125.14ms IncrementalHoareTripleChecker+Time [2021-09-13 14:31:39,256 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 208 Unknown, 0 Unchecked, 1.32ms Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 125.14ms Time] [2021-09-13 14:31:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-09-13 14:31:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2021-09-13 14:31:39,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:31:39,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.233695652173913) internal successors, (227), 188 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,746 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.233695652173913) internal successors, (227), 188 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,747 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.233695652173913) internal successors, (227), 188 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:39,749 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2021-09-13 14:31:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2021-09-13 14:31:39,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:39,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:39,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.233695652173913) internal successors, (227), 188 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 207 states. [2021-09-13 14:31:39,750 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.233695652173913) internal successors, (227), 188 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 207 states. [2021-09-13 14:31:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:39,753 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2021-09-13 14:31:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2021-09-13 14:31:39,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:39,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:39,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:31:39,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:31:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.233695652173913) internal successors, (227), 188 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 227 transitions. [2021-09-13 14:31:39,757 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 227 transitions. Word has length 27 [2021-09-13 14:31:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:31:39,757 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 227 transitions. [2021-09-13 14:31:39,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 227 transitions. [2021-09-13 14:31:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:31:39,758 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:31:39,758 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:31:39,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-09-13 14:31:39,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-09-13 14:31:39,973 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:31:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:31:39,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1112899551, now seen corresponding path program 1 times [2021-09-13 14:31:39,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:31:39,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825434637] [2021-09-13 14:31:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:39,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:31:39,979 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:31:39,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334175695] [2021-09-13 14:31:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:39,979 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:31:39,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:31:39,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:31:39,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-09-13 14:31:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:40,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 55 conjunts are in the unsatisfiable core [2021-09-13 14:31:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:40,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:31:41,038 INFO L281 TraceCheckUtils]: 0: Hoare triple {7824#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 1: Hoare triple {7824#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 2: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 3: Hoare triple {7824#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 4: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 5: Hoare triple {7824#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 6: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 7: Hoare triple {7824#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:41,039 INFO L281 TraceCheckUtils]: 8: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:41,040 INFO L281 TraceCheckUtils]: 9: Hoare triple {7824#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {7856#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,040 INFO L281 TraceCheckUtils]: 10: Hoare triple {7856#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !false; {7856#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,041 INFO L281 TraceCheckUtils]: 11: Hoare triple {7856#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {7863#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,041 INFO L281 TraceCheckUtils]: 12: Hoare triple {7863#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !false; {7863#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,042 INFO L281 TraceCheckUtils]: 13: Hoare triple {7863#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {7870#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,042 INFO L281 TraceCheckUtils]: 14: Hoare triple {7870#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7870#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,043 INFO L281 TraceCheckUtils]: 15: Hoare triple {7870#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {7870#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,044 INFO L281 TraceCheckUtils]: 16: Hoare triple {7870#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7880#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,044 INFO L281 TraceCheckUtils]: 17: Hoare triple {7880#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,045 INFO L281 TraceCheckUtils]: 18: Hoare triple {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,045 INFO L281 TraceCheckUtils]: 19: Hoare triple {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,046 INFO L281 TraceCheckUtils]: 20: Hoare triple {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7894#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,047 INFO L281 TraceCheckUtils]: 21: Hoare triple {7894#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,047 INFO L281 TraceCheckUtils]: 22: Hoare triple {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(main_~c~0 >= 2 * main_~v~0); {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:31:41,048 INFO L281 TraceCheckUtils]: 23: Hoare triple {7884#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {7904#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:31:41,049 INFO L281 TraceCheckUtils]: 24: Hoare triple {7904#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !false; {7904#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:31:41,049 INFO L281 TraceCheckUtils]: 25: Hoare triple {7904#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(main_~c~0 >= main_~b~0); {7904#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:31:41,050 INFO L281 TraceCheckUtils]: 26: Hoare triple {7904#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {7914#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:31:41,051 INFO L281 TraceCheckUtils]: 27: Hoare triple {7914#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !false; {7914#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:31:41,051 INFO L281 TraceCheckUtils]: 28: Hoare triple {7914#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 != main_~b~0); {7921#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:31:41,052 INFO L281 TraceCheckUtils]: 29: Hoare triple {7921#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:31:41,052 INFO L281 TraceCheckUtils]: 30: Hoare triple {7925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {7825#false} is VALID [2021-09-13 14:31:41,052 INFO L281 TraceCheckUtils]: 31: Hoare triple {7825#false} assume !false; {7825#false} is VALID [2021-09-13 14:31:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:31:41,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:31:41,959 INFO L281 TraceCheckUtils]: 31: Hoare triple {7825#false} assume !false; {7825#false} is VALID [2021-09-13 14:31:41,959 INFO L281 TraceCheckUtils]: 30: Hoare triple {7925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {7825#false} is VALID [2021-09-13 14:31:41,960 INFO L281 TraceCheckUtils]: 29: Hoare triple {7938#(= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)))} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:31:41,960 INFO L281 TraceCheckUtils]: 28: Hoare triple {7942#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 != main_~b~0); {7938#(= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:31:41,960 INFO L281 TraceCheckUtils]: 27: Hoare triple {7942#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !false; {7942#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:31:42,484 INFO L281 TraceCheckUtils]: 26: Hoare triple {7949#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {7942#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:31:42,484 INFO L281 TraceCheckUtils]: 25: Hoare triple {7949#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !(main_~c~0 >= main_~b~0); {7949#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:42,485 INFO L281 TraceCheckUtils]: 24: Hoare triple {7949#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !false; {7949#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:42,513 INFO L281 TraceCheckUtils]: 23: Hoare triple {7959#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {7949#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:31:42,513 INFO L281 TraceCheckUtils]: 22: Hoare triple {7959#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(main_~c~0 >= 2 * main_~v~0); {7959#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,514 INFO L281 TraceCheckUtils]: 21: Hoare triple {7966#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {7959#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,515 INFO L281 TraceCheckUtils]: 20: Hoare triple {7970#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7966#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,515 INFO L281 TraceCheckUtils]: 19: Hoare triple {7970#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {7970#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,515 INFO L281 TraceCheckUtils]: 18: Hoare triple {7970#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7970#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,516 INFO L281 TraceCheckUtils]: 17: Hoare triple {7980#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {7970#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,516 INFO L281 TraceCheckUtils]: 16: Hoare triple {7984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7980#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,516 INFO L281 TraceCheckUtils]: 15: Hoare triple {7984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {7984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,517 INFO L281 TraceCheckUtils]: 14: Hoare triple {7984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,518 INFO L281 TraceCheckUtils]: 13: Hoare triple {7994#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {7984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:31:42,518 INFO L281 TraceCheckUtils]: 12: Hoare triple {7994#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~c~0)))} assume !false; {7994#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:31:42,519 INFO L281 TraceCheckUtils]: 11: Hoare triple {8001#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~a~0)))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {7994#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:31:42,519 INFO L281 TraceCheckUtils]: 10: Hoare triple {8001#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~a~0)))} assume !false; {8001#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:31:42,520 INFO L281 TraceCheckUtils]: 9: Hoare triple {7824#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {8001#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:31:42,521 INFO L281 TraceCheckUtils]: 8: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:42,521 INFO L281 TraceCheckUtils]: 7: Hoare triple {7824#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:42,521 INFO L281 TraceCheckUtils]: 6: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:42,521 INFO L281 TraceCheckUtils]: 5: Hoare triple {7824#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:42,521 INFO L281 TraceCheckUtils]: 4: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:42,521 INFO L281 TraceCheckUtils]: 3: Hoare triple {7824#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:42,521 INFO L281 TraceCheckUtils]: 2: Hoare triple {7824#true} assume !(0 == assume_abort_if_not_~cond); {7824#true} is VALID [2021-09-13 14:31:42,522 INFO L281 TraceCheckUtils]: 1: Hoare triple {7824#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {7824#true} is VALID [2021-09-13 14:31:42,522 INFO L281 TraceCheckUtils]: 0: Hoare triple {7824#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {7824#true} is VALID [2021-09-13 14:31:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:31:42,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:31:42,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825434637] [2021-09-13 14:31:42,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:31:42,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334175695] [2021-09-13 14:31:42,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334175695] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:31:42,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:31:42,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-09-13 14:31:42,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233757957] [2021-09-13 14:31:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-09-13 14:31:42,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:42,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:31:42,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:42,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-09-13 14:31:42,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:31:42,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-09-13 14:31:42,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2021-09-13 14:31:42,663 INFO L87 Difference]: Start difference. First operand 189 states and 227 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:06,723 INFO L93 Difference]: Finished difference Result 416 states and 481 transitions. [2021-09-13 14:32:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-09-13 14:32:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-09-13 14:32:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 291 transitions. [2021-09-13 14:32:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 291 transitions. [2021-09-13 14:32:06,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 291 transitions. [2021-09-13 14:32:16,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:16,527 INFO L225 Difference]: With dead ends: 416 [2021-09-13 14:32:16,527 INFO L226 Difference]: Without dead ends: 404 [2021-09-13 14:32:16,528 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 8473.71ms TimeCoverageRelationStatistics Valid=1140, Invalid=5340, Unknown=0, NotChecked=0, Total=6480 [2021-09-13 14:32:16,529 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 669 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9129.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.57ms SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9144.83ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:16,529 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 0 Invalid, 1314 Unknown, 0 Unchecked, 10.57ms Time], IncrementalHoareTripleChecker [255 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 9144.83ms Time] [2021-09-13 14:32:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-09-13 14:32:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 269. [2021-09-13 14:32:17,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:17,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 404 states. Second operand has 269 states, 264 states have (on average 1.2159090909090908) internal successors, (321), 268 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:17,473 INFO L74 IsIncluded]: Start isIncluded. First operand 404 states. Second operand has 269 states, 264 states have (on average 1.2159090909090908) internal successors, (321), 268 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:17,474 INFO L87 Difference]: Start difference. First operand 404 states. Second operand has 269 states, 264 states have (on average 1.2159090909090908) internal successors, (321), 268 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:17,481 INFO L93 Difference]: Finished difference Result 404 states and 462 transitions. [2021-09-13 14:32:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 462 transitions. [2021-09-13 14:32:17,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:17,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:17,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 264 states have (on average 1.2159090909090908) internal successors, (321), 268 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 404 states. [2021-09-13 14:32:17,483 INFO L87 Difference]: Start difference. First operand has 269 states, 264 states have (on average 1.2159090909090908) internal successors, (321), 268 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 404 states. [2021-09-13 14:32:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:17,489 INFO L93 Difference]: Finished difference Result 404 states and 462 transitions. [2021-09-13 14:32:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 462 transitions. [2021-09-13 14:32:17,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:17,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:17,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:17,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.2159090909090908) internal successors, (321), 268 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 321 transitions. [2021-09-13 14:32:17,495 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 321 transitions. Word has length 32 [2021-09-13 14:32:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:17,495 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 321 transitions. [2021-09-13 14:32:17,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 321 transitions. [2021-09-13 14:32:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:32:17,496 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:17,496 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:32:17,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-09-13 14:32:17,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-09-13 14:32:17,709 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:32:17,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:17,709 INFO L82 PathProgramCache]: Analyzing trace with hash -986732336, now seen corresponding path program 1 times [2021-09-13 14:32:17,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:32:17,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624407234] [2021-09-13 14:32:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:17,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:32:17,715 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:32:17,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568847925] [2021-09-13 14:32:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:17,715 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:32:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:32:17,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:32:17,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-09-13 14:32:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:17,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2021-09-13 14:32:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:17,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:18,785 INFO L281 TraceCheckUtils]: 0: Hoare triple {9932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {9932#true} is VALID [2021-09-13 14:32:18,785 INFO L281 TraceCheckUtils]: 1: Hoare triple {9932#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9932#true} is VALID [2021-09-13 14:32:18,785 INFO L281 TraceCheckUtils]: 2: Hoare triple {9932#true} assume !(0 == assume_abort_if_not_~cond); {9932#true} is VALID [2021-09-13 14:32:18,787 INFO L281 TraceCheckUtils]: 3: Hoare triple {9932#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9946#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:32:18,787 INFO L281 TraceCheckUtils]: 4: Hoare triple {9946#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 5 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:18,787 INFO L281 TraceCheckUtils]: 5: Hoare triple {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:18,788 INFO L281 TraceCheckUtils]: 6: Hoare triple {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:18,788 INFO L281 TraceCheckUtils]: 7: Hoare triple {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:18,789 INFO L281 TraceCheckUtils]: 8: Hoare triple {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:18,789 INFO L281 TraceCheckUtils]: 9: Hoare triple {9950#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {9966#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,789 INFO L281 TraceCheckUtils]: 10: Hoare triple {9966#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !false; {9966#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,790 INFO L281 TraceCheckUtils]: 11: Hoare triple {9966#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {9973#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,790 INFO L281 TraceCheckUtils]: 12: Hoare triple {9973#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} assume !false; {9973#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,791 INFO L281 TraceCheckUtils]: 13: Hoare triple {9973#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,791 INFO L281 TraceCheckUtils]: 14: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,792 INFO L281 TraceCheckUtils]: 15: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,792 INFO L281 TraceCheckUtils]: 16: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,793 INFO L281 TraceCheckUtils]: 17: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,793 INFO L281 TraceCheckUtils]: 18: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,794 INFO L281 TraceCheckUtils]: 19: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,794 INFO L281 TraceCheckUtils]: 20: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,795 INFO L281 TraceCheckUtils]: 21: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,795 INFO L281 TraceCheckUtils]: 22: Hoare triple {9980#(and (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {10008#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,796 INFO L281 TraceCheckUtils]: 23: Hoare triple {10008#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10008#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,796 INFO L281 TraceCheckUtils]: 24: Hoare triple {10008#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {10008#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:18,797 INFO L281 TraceCheckUtils]: 25: Hoare triple {10008#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= ULTIMATE.start_main_~y~0 5) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10018#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 ULTIMATE.start_main_~b~0)) (and (<= 0 ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~b~0 5))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:32:18,798 INFO L281 TraceCheckUtils]: 26: Hoare triple {10018#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 ULTIMATE.start_main_~b~0)) (and (<= 0 ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~b~0 5))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {10022#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 2) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 5))} is VALID [2021-09-13 14:32:18,798 INFO L281 TraceCheckUtils]: 27: Hoare triple {10022#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 2) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 5))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10022#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 2) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 5))} is VALID [2021-09-13 14:32:18,799 INFO L281 TraceCheckUtils]: 28: Hoare triple {10022#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 2) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 5))} assume !(0 == __VERIFIER_assert_~cond); {10022#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 2) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 5))} is VALID [2021-09-13 14:32:18,799 INFO L281 TraceCheckUtils]: 29: Hoare triple {10022#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 2) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 5))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10032#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:32:18,799 INFO L281 TraceCheckUtils]: 30: Hoare triple {10032#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {9933#false} is VALID [2021-09-13 14:32:18,800 INFO L281 TraceCheckUtils]: 31: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2021-09-13 14:32:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:32:18,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:23,574 INFO L281 TraceCheckUtils]: 31: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2021-09-13 14:32:23,574 INFO L281 TraceCheckUtils]: 30: Hoare triple {10032#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {9933#false} is VALID [2021-09-13 14:32:23,574 INFO L281 TraceCheckUtils]: 29: Hoare triple {10045#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10032#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:32:23,575 INFO L281 TraceCheckUtils]: 28: Hoare triple {10045#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {10045#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:23,575 INFO L281 TraceCheckUtils]: 27: Hoare triple {10045#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10045#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:23,575 INFO L281 TraceCheckUtils]: 26: Hoare triple {10055#(or (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !(0 == __VERIFIER_assert_~cond); {10045#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:25,578 INFO L281 TraceCheckUtils]: 25: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10055#(or (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is UNKNOWN [2021-09-13 14:32:25,579 INFO L281 TraceCheckUtils]: 24: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !(0 == __VERIFIER_assert_~cond); {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,580 INFO L281 TraceCheckUtils]: 23: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,582 INFO L281 TraceCheckUtils]: 22: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,582 INFO L281 TraceCheckUtils]: 21: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !(0 == __VERIFIER_assert_~cond); {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,583 INFO L281 TraceCheckUtils]: 20: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,583 INFO L281 TraceCheckUtils]: 19: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !(0 == __VERIFIER_assert_~cond); {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,583 INFO L281 TraceCheckUtils]: 18: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,584 INFO L281 TraceCheckUtils]: 17: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !(0 == __VERIFIER_assert_~cond); {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,584 INFO L281 TraceCheckUtils]: 16: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,584 INFO L281 TraceCheckUtils]: 15: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !(0 == __VERIFIER_assert_~cond); {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,584 INFO L281 TraceCheckUtils]: 14: Hoare triple {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 13: Hoare triple {9932#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {10059#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 12: Hoare triple {9932#true} assume !false; {9932#true} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 11: Hoare triple {9932#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {9932#true} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 10: Hoare triple {9932#true} assume !false; {9932#true} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 9: Hoare triple {9932#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {9932#true} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 8: Hoare triple {9932#true} assume !(0 == assume_abort_if_not_~cond); {9932#true} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 7: Hoare triple {9932#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9932#true} is VALID [2021-09-13 14:32:25,585 INFO L281 TraceCheckUtils]: 6: Hoare triple {9932#true} assume !(0 == assume_abort_if_not_~cond); {9932#true} is VALID [2021-09-13 14:32:25,586 INFO L281 TraceCheckUtils]: 5: Hoare triple {9932#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9932#true} is VALID [2021-09-13 14:32:25,586 INFO L281 TraceCheckUtils]: 4: Hoare triple {9932#true} assume !(0 == assume_abort_if_not_~cond); {9932#true} is VALID [2021-09-13 14:32:25,586 INFO L281 TraceCheckUtils]: 3: Hoare triple {9932#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9932#true} is VALID [2021-09-13 14:32:25,586 INFO L281 TraceCheckUtils]: 2: Hoare triple {9932#true} assume !(0 == assume_abort_if_not_~cond); {9932#true} is VALID [2021-09-13 14:32:25,586 INFO L281 TraceCheckUtils]: 1: Hoare triple {9932#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9932#true} is VALID [2021-09-13 14:32:25,586 INFO L281 TraceCheckUtils]: 0: Hoare triple {9932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {9932#true} is VALID [2021-09-13 14:32:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:32:25,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:32:25,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624407234] [2021-09-13 14:32:25,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:32:25,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568847925] [2021-09-13 14:32:25,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568847925] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:32:25,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:32:25,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2021-09-13 14:32:25,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131938156] [2021-09-13 14:32:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-09-13 14:32:25,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:25,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:27,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:27,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:32:27,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:32:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:32:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:32:27,634 INFO L87 Difference]: Start difference. First operand 269 states and 321 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:30,065 INFO L93 Difference]: Finished difference Result 311 states and 371 transitions. [2021-09-13 14:32:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:32:30,065 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-09-13 14:32:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2021-09-13 14:32:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2021-09-13 14:32:30,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 106 transitions. [2021-09-13 14:32:30,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:30,182 INFO L225 Difference]: With dead ends: 311 [2021-09-13 14:32:30,183 INFO L226 Difference]: Without dead ends: 309 [2021-09-13 14:32:30,183 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 458.87ms TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2021-09-13 14:32:30,184 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 480.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 483.77ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:30,184 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 469 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [33 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 483.77ms Time] [2021-09-13 14:32:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-09-13 14:32:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 187. [2021-09-13 14:32:30,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:30,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 187 states, 183 states have (on average 1.1967213114754098) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,869 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 187 states, 183 states have (on average 1.1967213114754098) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,870 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 187 states, 183 states have (on average 1.1967213114754098) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:30,874 INFO L93 Difference]: Finished difference Result 309 states and 358 transitions. [2021-09-13 14:32:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 358 transitions. [2021-09-13 14:32:30,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:30,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:30,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 183 states have (on average 1.1967213114754098) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 309 states. [2021-09-13 14:32:30,875 INFO L87 Difference]: Start difference. First operand has 187 states, 183 states have (on average 1.1967213114754098) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 309 states. [2021-09-13 14:32:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:30,879 INFO L93 Difference]: Finished difference Result 309 states and 358 transitions. [2021-09-13 14:32:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 358 transitions. [2021-09-13 14:32:30,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:30,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:30,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:30,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 183 states have (on average 1.1967213114754098) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2021-09-13 14:32:30,882 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 32 [2021-09-13 14:32:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:30,882 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2021-09-13 14:32:30,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2021-09-13 14:32:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-09-13 14:32:30,883 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:30,883 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:32:30,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-09-13 14:32:31,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-09-13 14:32:31,098 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:32:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash -315127458, now seen corresponding path program 2 times [2021-09-13 14:32:31,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:32:31,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921678925] [2021-09-13 14:32:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:31,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:32:31,111 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:32:31,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071725574] [2021-09-13 14:32:31,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:32:31,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:32:31,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:32:31,116 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:32:31,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-09-13 14:32:31,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:32:31,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:32:31,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 14:32:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:31,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 0: Hoare triple {11499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {11499#true} is VALID [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 1: Hoare triple {11499#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 2: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 3: Hoare triple {11499#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 4: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 5: Hoare triple {11499#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 6: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,362 INFO L281 TraceCheckUtils]: 7: Hoare triple {11499#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,363 INFO L281 TraceCheckUtils]: 8: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,363 INFO L281 TraceCheckUtils]: 9: Hoare triple {11499#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {11499#true} is VALID [2021-09-13 14:32:31,363 INFO L281 TraceCheckUtils]: 10: Hoare triple {11499#true} assume !false; {11499#true} is VALID [2021-09-13 14:32:31,363 INFO L281 TraceCheckUtils]: 11: Hoare triple {11499#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {11499#true} is VALID [2021-09-13 14:32:31,363 INFO L281 TraceCheckUtils]: 12: Hoare triple {11499#true} assume !false; {11499#true} is VALID [2021-09-13 14:32:31,363 INFO L281 TraceCheckUtils]: 13: Hoare triple {11499#true} assume !(main_~c~0 >= main_~b~0); {11543#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:31,364 INFO L281 TraceCheckUtils]: 14: Hoare triple {11543#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:32:31,364 INFO L281 TraceCheckUtils]: 15: Hoare triple {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !false; {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:32:31,364 INFO L281 TraceCheckUtils]: 16: Hoare triple {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,364 INFO L281 TraceCheckUtils]: 17: Hoare triple {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !false; {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,365 INFO L281 TraceCheckUtils]: 18: Hoare triple {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,366 INFO L281 TraceCheckUtils]: 19: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,366 INFO L281 TraceCheckUtils]: 20: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,366 INFO L281 TraceCheckUtils]: 21: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,366 INFO L281 TraceCheckUtils]: 22: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,367 INFO L281 TraceCheckUtils]: 23: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,367 INFO L281 TraceCheckUtils]: 24: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,367 INFO L281 TraceCheckUtils]: 25: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,367 INFO L281 TraceCheckUtils]: 26: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,368 INFO L281 TraceCheckUtils]: 27: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= 2 * main_~v~0); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,368 INFO L281 TraceCheckUtils]: 28: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {11592#(< 0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,369 INFO L281 TraceCheckUtils]: 29: Hoare triple {11592#(< 0 ULTIMATE.start_main_~c~0)} assume !false; {11592#(< 0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,369 INFO L281 TraceCheckUtils]: 30: Hoare triple {11592#(< 0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {11592#(< 0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,369 INFO L281 TraceCheckUtils]: 31: Hoare triple {11592#(< 0 ULTIMATE.start_main_~c~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {11602#(< 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:31,370 INFO L281 TraceCheckUtils]: 32: Hoare triple {11602#(< 0 ULTIMATE.start_main_~b~0)} assume !false; {11602#(< 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:31,370 INFO L281 TraceCheckUtils]: 33: Hoare triple {11602#(< 0 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {11500#false} is VALID [2021-09-13 14:32:31,370 INFO L281 TraceCheckUtils]: 34: Hoare triple {11500#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11500#false} is VALID [2021-09-13 14:32:31,370 INFO L281 TraceCheckUtils]: 35: Hoare triple {11500#false} assume 0 == __VERIFIER_assert_~cond; {11500#false} is VALID [2021-09-13 14:32:31,370 INFO L281 TraceCheckUtils]: 36: Hoare triple {11500#false} assume !false; {11500#false} is VALID [2021-09-13 14:32:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:32:31,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:31,558 INFO L281 TraceCheckUtils]: 36: Hoare triple {11500#false} assume !false; {11500#false} is VALID [2021-09-13 14:32:31,558 INFO L281 TraceCheckUtils]: 35: Hoare triple {11500#false} assume 0 == __VERIFIER_assert_~cond; {11500#false} is VALID [2021-09-13 14:32:31,558 INFO L281 TraceCheckUtils]: 34: Hoare triple {11500#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11500#false} is VALID [2021-09-13 14:32:31,558 INFO L281 TraceCheckUtils]: 33: Hoare triple {11602#(< 0 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {11500#false} is VALID [2021-09-13 14:32:31,559 INFO L281 TraceCheckUtils]: 32: Hoare triple {11602#(< 0 ULTIMATE.start_main_~b~0)} assume !false; {11602#(< 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:31,559 INFO L281 TraceCheckUtils]: 31: Hoare triple {11592#(< 0 ULTIMATE.start_main_~c~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {11602#(< 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:31,559 INFO L281 TraceCheckUtils]: 30: Hoare triple {11592#(< 0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {11592#(< 0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,560 INFO L281 TraceCheckUtils]: 29: Hoare triple {11592#(< 0 ULTIMATE.start_main_~c~0)} assume !false; {11592#(< 0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,560 INFO L281 TraceCheckUtils]: 28: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {11592#(< 0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,561 INFO L281 TraceCheckUtils]: 27: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= 2 * main_~v~0); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,561 INFO L281 TraceCheckUtils]: 26: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,561 INFO L281 TraceCheckUtils]: 25: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,561 INFO L281 TraceCheckUtils]: 24: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,562 INFO L281 TraceCheckUtils]: 23: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,562 INFO L281 TraceCheckUtils]: 22: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,562 INFO L281 TraceCheckUtils]: 21: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,562 INFO L281 TraceCheckUtils]: 20: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,563 INFO L281 TraceCheckUtils]: 19: Hoare triple {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,564 INFO L281 TraceCheckUtils]: 18: Hoare triple {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {11561#(< ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,564 INFO L281 TraceCheckUtils]: 17: Hoare triple {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !false; {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,565 INFO L281 TraceCheckUtils]: 16: Hoare triple {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {11554#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:32:31,565 INFO L281 TraceCheckUtils]: 15: Hoare triple {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !false; {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:32:31,566 INFO L281 TraceCheckUtils]: 14: Hoare triple {11543#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {11547#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:32:31,566 INFO L281 TraceCheckUtils]: 13: Hoare triple {11499#true} assume !(main_~c~0 >= main_~b~0); {11543#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:31,566 INFO L281 TraceCheckUtils]: 12: Hoare triple {11499#true} assume !false; {11499#true} is VALID [2021-09-13 14:32:31,566 INFO L281 TraceCheckUtils]: 11: Hoare triple {11499#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {11499#true} is VALID [2021-09-13 14:32:31,566 INFO L281 TraceCheckUtils]: 10: Hoare triple {11499#true} assume !false; {11499#true} is VALID [2021-09-13 14:32:31,566 INFO L281 TraceCheckUtils]: 9: Hoare triple {11499#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {11499#true} is VALID [2021-09-13 14:32:31,566 INFO L281 TraceCheckUtils]: 8: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 7: Hoare triple {11499#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 6: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 5: Hoare triple {11499#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 4: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 3: Hoare triple {11499#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 2: Hoare triple {11499#true} assume !(0 == assume_abort_if_not_~cond); {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 1: Hoare triple {11499#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L281 TraceCheckUtils]: 0: Hoare triple {11499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {11499#true} is VALID [2021-09-13 14:32:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:32:31,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:32:31,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921678925] [2021-09-13 14:32:31,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:32:31,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071725574] [2021-09-13 14:32:31,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071725574] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:32:31,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:32:31,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-09-13 14:32:31,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688841500] [2021-09-13 14:32:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-09-13 14:32:31,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:31,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:31,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:31,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:32:31,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:32:31,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:32:31,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:32:31,592 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:33,702 INFO L93 Difference]: Finished difference Result 370 states and 425 transitions. [2021-09-13 14:32:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-13 14:32:33,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-09-13 14:32:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2021-09-13 14:32:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2021-09-13 14:32:33,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 171 transitions. [2021-09-13 14:32:33,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:33,842 INFO L225 Difference]: With dead ends: 370 [2021-09-13 14:32:33,843 INFO L226 Difference]: Without dead ends: 366 [2021-09-13 14:32:33,843 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 146.87ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-09-13 14:32:33,843 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 352.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 354.44ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:33,844 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [15 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 354.44ms Time] [2021-09-13 14:32:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-09-13 14:32:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 206. [2021-09-13 14:32:34,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:34,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 206 states, 202 states have (on average 1.202970297029703) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:34,646 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 206 states, 202 states have (on average 1.202970297029703) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:34,647 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 206 states, 202 states have (on average 1.202970297029703) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:34,652 INFO L93 Difference]: Finished difference Result 366 states and 421 transitions. [2021-09-13 14:32:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 421 transitions. [2021-09-13 14:32:34,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:34,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:34,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 202 states have (on average 1.202970297029703) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 366 states. [2021-09-13 14:32:34,653 INFO L87 Difference]: Start difference. First operand has 206 states, 202 states have (on average 1.202970297029703) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 366 states. [2021-09-13 14:32:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:34,658 INFO L93 Difference]: Finished difference Result 366 states and 421 transitions. [2021-09-13 14:32:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 421 transitions. [2021-09-13 14:32:34,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:34,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:34,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:34,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 202 states have (on average 1.202970297029703) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2021-09-13 14:32:34,661 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 37 [2021-09-13 14:32:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:34,662 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2021-09-13 14:32:34,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2021-09-13 14:32:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-09-13 14:32:34,662 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:34,662 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:32:34,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-09-13 14:32:34,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-09-13 14:32:34,879 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:32:34,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash 913672398, now seen corresponding path program 1 times [2021-09-13 14:32:34,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:32:34,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106682317] [2021-09-13 14:32:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:34,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:32:34,885 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:32:34,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226065038] [2021-09-13 14:32:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:34,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:32:34,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:32:34,886 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:32:34,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-09-13 14:32:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:34,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:32:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:34,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:35,087 INFO L281 TraceCheckUtils]: 0: Hoare triple {13305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {13305#true} is VALID [2021-09-13 14:32:35,087 INFO L281 TraceCheckUtils]: 1: Hoare triple {13305#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {13305#true} is VALID [2021-09-13 14:32:35,087 INFO L281 TraceCheckUtils]: 2: Hoare triple {13305#true} assume !(0 == assume_abort_if_not_~cond); {13305#true} is VALID [2021-09-13 14:32:35,087 INFO L281 TraceCheckUtils]: 3: Hoare triple {13305#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {13305#true} is VALID [2021-09-13 14:32:35,087 INFO L281 TraceCheckUtils]: 4: Hoare triple {13305#true} assume !(0 == assume_abort_if_not_~cond); {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 5: Hoare triple {13305#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 6: Hoare triple {13305#true} assume !(0 == assume_abort_if_not_~cond); {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 7: Hoare triple {13305#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 8: Hoare triple {13305#true} assume !(0 == assume_abort_if_not_~cond); {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 9: Hoare triple {13305#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 10: Hoare triple {13305#true} assume !false; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 11: Hoare triple {13305#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 12: Hoare triple {13305#true} assume !false; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 13: Hoare triple {13305#true} assume !(main_~c~0 >= main_~b~0); {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 14: Hoare triple {13305#true} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 15: Hoare triple {13305#true} assume !false; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 16: Hoare triple {13305#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {13305#true} is VALID [2021-09-13 14:32:35,088 INFO L281 TraceCheckUtils]: 17: Hoare triple {13305#true} assume !false; {13305#true} is VALID [2021-09-13 14:32:35,089 INFO L281 TraceCheckUtils]: 18: Hoare triple {13305#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,089 INFO L281 TraceCheckUtils]: 19: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,089 INFO L281 TraceCheckUtils]: 20: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,089 INFO L281 TraceCheckUtils]: 21: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,090 INFO L281 TraceCheckUtils]: 22: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,090 INFO L281 TraceCheckUtils]: 23: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,090 INFO L281 TraceCheckUtils]: 24: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,090 INFO L281 TraceCheckUtils]: 25: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,091 INFO L281 TraceCheckUtils]: 26: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,091 INFO L281 TraceCheckUtils]: 27: Hoare triple {13364#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= 2 * main_~v~0); {13392#(and (<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:32:35,092 INFO L281 TraceCheckUtils]: 28: Hoare triple {13392#(and (<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {13396#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,092 INFO L281 TraceCheckUtils]: 29: Hoare triple {13396#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !false; {13396#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:35,092 INFO L281 TraceCheckUtils]: 30: Hoare triple {13396#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {13306#false} is VALID [2021-09-13 14:32:35,092 INFO L281 TraceCheckUtils]: 31: Hoare triple {13306#false} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13306#false} is VALID [2021-09-13 14:32:35,093 INFO L281 TraceCheckUtils]: 32: Hoare triple {13306#false} assume !(0 == __VERIFIER_assert_~cond); {13306#false} is VALID [2021-09-13 14:32:35,093 INFO L281 TraceCheckUtils]: 33: Hoare triple {13306#false} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13306#false} is VALID [2021-09-13 14:32:35,093 INFO L281 TraceCheckUtils]: 34: Hoare triple {13306#false} assume !(0 == __VERIFIER_assert_~cond); {13306#false} is VALID [2021-09-13 14:32:35,093 INFO L281 TraceCheckUtils]: 35: Hoare triple {13306#false} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13306#false} is VALID [2021-09-13 14:32:35,093 INFO L281 TraceCheckUtils]: 36: Hoare triple {13306#false} assume 0 == __VERIFIER_assert_~cond; {13306#false} is VALID [2021-09-13 14:32:35,093 INFO L281 TraceCheckUtils]: 37: Hoare triple {13306#false} assume !false; {13306#false} is VALID [2021-09-13 14:32:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-09-13 14:32:35,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:32:35,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:32:35,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106682317] [2021-09-13 14:32:35,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:32:35,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226065038] [2021-09-13 14:32:35,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226065038] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:32:35,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:32:35,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:32:35,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673367514] [2021-09-13 14:32:35,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-09-13 14:32:35,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:35,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:35,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:35,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:32:35,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:32:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:32:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:32:35,119 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:36,459 INFO L93 Difference]: Finished difference Result 424 states and 507 transitions. [2021-09-13 14:32:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:32:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-09-13 14:32:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2021-09-13 14:32:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2021-09-13 14:32:36,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2021-09-13 14:32:36,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:36,515 INFO L225 Difference]: With dead ends: 424 [2021-09-13 14:32:36,516 INFO L226 Difference]: Without dead ends: 284 [2021-09-13 14:32:36,516 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.57ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:32:36,517 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.29ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:36,517 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 134 Unknown, 0 Unchecked, 0.48ms Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 93.29ms Time] [2021-09-13 14:32:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-09-13 14:32:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2021-09-13 14:32:37,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:37,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 260 states, 256 states have (on average 1.19921875) internal successors, (307), 259 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:37,618 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 260 states, 256 states have (on average 1.19921875) internal successors, (307), 259 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:37,618 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 260 states, 256 states have (on average 1.19921875) internal successors, (307), 259 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:37,621 INFO L93 Difference]: Finished difference Result 284 states and 328 transitions. [2021-09-13 14:32:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2021-09-13 14:32:37,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:37,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:37,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 256 states have (on average 1.19921875) internal successors, (307), 259 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 284 states. [2021-09-13 14:32:37,622 INFO L87 Difference]: Start difference. First operand has 260 states, 256 states have (on average 1.19921875) internal successors, (307), 259 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 284 states. [2021-09-13 14:32:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:37,626 INFO L93 Difference]: Finished difference Result 284 states and 328 transitions. [2021-09-13 14:32:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2021-09-13 14:32:37,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:37,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:37,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:37,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 256 states have (on average 1.19921875) internal successors, (307), 259 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 307 transitions. [2021-09-13 14:32:37,630 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 307 transitions. Word has length 38 [2021-09-13 14:32:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:37,630 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 307 transitions. [2021-09-13 14:32:37,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 307 transitions. [2021-09-13 14:32:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-09-13 14:32:37,631 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:37,631 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:32:37,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-09-13 14:32:37,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:32:37,846 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:32:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2091903451, now seen corresponding path program 1 times [2021-09-13 14:32:37,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:32:37,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008532265] [2021-09-13 14:32:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:37,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:32:37,855 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:32:37,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1117664156] [2021-09-13 14:32:37,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:37,856 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:32:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:32:37,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:32:37,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-09-13 14:32:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:37,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:32:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:37,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 0: Hoare triple {14991#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 1: Hoare triple {14991#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 2: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 3: Hoare triple {14991#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 4: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 5: Hoare triple {14991#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 6: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 7: Hoare triple {14991#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 8: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 9: Hoare triple {14991#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 10: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 11: Hoare triple {14991#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {14991#true} is VALID [2021-09-13 14:32:38,179 INFO L281 TraceCheckUtils]: 12: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 13: Hoare triple {14991#true} assume !(main_~c~0 >= main_~b~0); {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 14: Hoare triple {14991#true} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 15: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 16: Hoare triple {14991#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 17: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 18: Hoare triple {14991#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 19: Hoare triple {14991#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,180 INFO L281 TraceCheckUtils]: 20: Hoare triple {14991#true} assume !(0 == __VERIFIER_assert_~cond); {14991#true} is VALID [2021-09-13 14:32:38,181 INFO L281 TraceCheckUtils]: 21: Hoare triple {14991#true} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15059#(or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))} is VALID [2021-09-13 14:32:38,181 INFO L281 TraceCheckUtils]: 22: Hoare triple {15059#(or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)))} assume !(0 == __VERIFIER_assert_~cond); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,182 INFO L281 TraceCheckUtils]: 23: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,182 INFO L281 TraceCheckUtils]: 24: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,182 INFO L281 TraceCheckUtils]: 25: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,182 INFO L281 TraceCheckUtils]: 26: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,183 INFO L281 TraceCheckUtils]: 27: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= 2 * main_~v~0); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,183 INFO L281 TraceCheckUtils]: 28: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,183 INFO L281 TraceCheckUtils]: 29: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !false; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,183 INFO L281 TraceCheckUtils]: 30: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= main_~b~0); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,184 INFO L281 TraceCheckUtils]: 31: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,184 INFO L281 TraceCheckUtils]: 32: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,184 INFO L281 TraceCheckUtils]: 33: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,185 INFO L281 TraceCheckUtils]: 34: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,185 INFO L281 TraceCheckUtils]: 35: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,185 INFO L281 TraceCheckUtils]: 36: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15107#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:32:38,186 INFO L281 TraceCheckUtils]: 37: Hoare triple {15107#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {14992#false} is VALID [2021-09-13 14:32:38,186 INFO L281 TraceCheckUtils]: 38: Hoare triple {14992#false} assume !false; {14992#false} is VALID [2021-09-13 14:32:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-09-13 14:32:38,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:38,428 INFO L281 TraceCheckUtils]: 38: Hoare triple {14992#false} assume !false; {14992#false} is VALID [2021-09-13 14:32:38,429 INFO L281 TraceCheckUtils]: 37: Hoare triple {15107#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {14992#false} is VALID [2021-09-13 14:32:38,429 INFO L281 TraceCheckUtils]: 36: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15107#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:32:38,430 INFO L281 TraceCheckUtils]: 35: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,430 INFO L281 TraceCheckUtils]: 34: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,430 INFO L281 TraceCheckUtils]: 33: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,430 INFO L281 TraceCheckUtils]: 32: Hoare triple {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !false; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,431 INFO L281 TraceCheckUtils]: 31: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {15091#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:38,432 INFO L281 TraceCheckUtils]: 30: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= main_~b~0); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,432 INFO L281 TraceCheckUtils]: 29: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !false; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,432 INFO L281 TraceCheckUtils]: 28: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,433 INFO L281 TraceCheckUtils]: 27: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= 2 * main_~v~0); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,435 INFO L281 TraceCheckUtils]: 26: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,435 INFO L281 TraceCheckUtils]: 25: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,436 INFO L281 TraceCheckUtils]: 24: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,436 INFO L281 TraceCheckUtils]: 23: Hoare triple {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,436 INFO L281 TraceCheckUtils]: 22: Hoare triple {15162#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {15063#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:38,437 INFO L281 TraceCheckUtils]: 21: Hoare triple {14991#true} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15162#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:32:38,437 INFO L281 TraceCheckUtils]: 20: Hoare triple {14991#true} assume !(0 == __VERIFIER_assert_~cond); {14991#true} is VALID [2021-09-13 14:32:38,437 INFO L281 TraceCheckUtils]: 19: Hoare triple {14991#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,437 INFO L281 TraceCheckUtils]: 18: Hoare triple {14991#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {14991#true} is VALID [2021-09-13 14:32:38,437 INFO L281 TraceCheckUtils]: 17: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,437 INFO L281 TraceCheckUtils]: 16: Hoare triple {14991#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 15: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 14: Hoare triple {14991#true} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 13: Hoare triple {14991#true} assume !(main_~c~0 >= main_~b~0); {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 12: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 11: Hoare triple {14991#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 10: Hoare triple {14991#true} assume !false; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 9: Hoare triple {14991#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 8: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 7: Hoare triple {14991#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,438 INFO L281 TraceCheckUtils]: 6: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,439 INFO L281 TraceCheckUtils]: 5: Hoare triple {14991#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,439 INFO L281 TraceCheckUtils]: 4: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,439 INFO L281 TraceCheckUtils]: 3: Hoare triple {14991#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,439 INFO L281 TraceCheckUtils]: 2: Hoare triple {14991#true} assume !(0 == assume_abort_if_not_~cond); {14991#true} is VALID [2021-09-13 14:32:38,439 INFO L281 TraceCheckUtils]: 1: Hoare triple {14991#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14991#true} is VALID [2021-09-13 14:32:38,439 INFO L281 TraceCheckUtils]: 0: Hoare triple {14991#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {14991#true} is VALID [2021-09-13 14:32:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-09-13 14:32:38,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:32:38,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008532265] [2021-09-13 14:32:38,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:32:38,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117664156] [2021-09-13 14:32:38,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117664156] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:32:38,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:32:38,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-09-13 14:32:38,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045804000] [2021-09-13 14:32:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-09-13 14:32:38,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:38,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:38,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:38,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:32:38,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:32:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:32:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:32:38,470 INFO L87 Difference]: Start difference. First operand 260 states and 307 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:40,164 INFO L93 Difference]: Finished difference Result 262 states and 308 transitions. [2021-09-13 14:32:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:32:40,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-09-13 14:32:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2021-09-13 14:32:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2021-09-13 14:32:40,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2021-09-13 14:32:40,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:40,207 INFO L225 Difference]: With dead ends: 262 [2021-09-13 14:32:40,207 INFO L226 Difference]: Without dead ends: 258 [2021-09-13 14:32:40,207 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 115.26ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:32:40,208 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 235.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.58ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 236.80ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:40,208 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.58ms Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 236.80ms Time] [2021-09-13 14:32:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-09-13 14:32:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 152. [2021-09-13 14:32:40,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:40,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 152 states, 149 states have (on average 1.1342281879194631) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,943 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 152 states, 149 states have (on average 1.1342281879194631) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,944 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 152 states, 149 states have (on average 1.1342281879194631) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:40,946 INFO L93 Difference]: Finished difference Result 258 states and 296 transitions. [2021-09-13 14:32:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2021-09-13 14:32:40,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:40,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:40,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 149 states have (on average 1.1342281879194631) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2021-09-13 14:32:40,947 INFO L87 Difference]: Start difference. First operand has 152 states, 149 states have (on average 1.1342281879194631) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2021-09-13 14:32:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:40,950 INFO L93 Difference]: Finished difference Result 258 states and 296 transitions. [2021-09-13 14:32:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2021-09-13 14:32:40,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:40,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:40,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:40,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 149 states have (on average 1.1342281879194631) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2021-09-13 14:32:40,953 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 39 [2021-09-13 14:32:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:40,953 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2021-09-13 14:32:40,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2021-09-13 14:32:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:32:40,954 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:40,954 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:32:40,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-09-13 14:32:41,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-09-13 14:32:41,161 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:32:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash 274679198, now seen corresponding path program 1 times [2021-09-13 14:32:41,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:32:41,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321419900] [2021-09-13 14:32:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:41,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:32:41,166 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:32:41,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341747198] [2021-09-13 14:32:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:41,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:32:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:32:41,170 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:32:41,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-09-13 14:32:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:41,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 73 conjunts are in the unsatisfiable core [2021-09-13 14:32:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:41,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:42,849 INFO L281 TraceCheckUtils]: 0: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 1: Hoare triple {16359#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 2: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 3: Hoare triple {16359#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 4: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 5: Hoare triple {16359#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 6: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 7: Hoare triple {16359#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:42,850 INFO L281 TraceCheckUtils]: 8: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:42,851 INFO L281 TraceCheckUtils]: 9: Hoare triple {16359#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {16391#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:42,851 INFO L281 TraceCheckUtils]: 10: Hoare triple {16391#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {16391#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:42,851 INFO L281 TraceCheckUtils]: 11: Hoare triple {16391#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {16398#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:42,852 INFO L281 TraceCheckUtils]: 12: Hoare triple {16398#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {16398#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:42,852 INFO L281 TraceCheckUtils]: 13: Hoare triple {16398#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {16405#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:32:42,853 INFO L281 TraceCheckUtils]: 14: Hoare triple {16405#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {16409#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:42,853 INFO L281 TraceCheckUtils]: 15: Hoare triple {16409#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !false; {16409#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:42,854 INFO L281 TraceCheckUtils]: 16: Hoare triple {16409#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {16416#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:42,854 INFO L281 TraceCheckUtils]: 17: Hoare triple {16416#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !false; {16416#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:42,854 INFO L281 TraceCheckUtils]: 18: Hoare triple {16416#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {16423#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:42,855 INFO L281 TraceCheckUtils]: 19: Hoare triple {16423#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16427#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,855 INFO L281 TraceCheckUtils]: 20: Hoare triple {16427#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,856 INFO L281 TraceCheckUtils]: 21: Hoare triple {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,856 INFO L281 TraceCheckUtils]: 22: Hoare triple {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,857 INFO L281 TraceCheckUtils]: 23: Hoare triple {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,857 INFO L281 TraceCheckUtils]: 24: Hoare triple {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,858 INFO L281 TraceCheckUtils]: 25: Hoare triple {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,858 INFO L281 TraceCheckUtils]: 26: Hoare triple {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,858 INFO L281 TraceCheckUtils]: 27: Hoare triple {16431#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(main_~c~0 >= 2 * main_~v~0); {16453#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:32:42,865 INFO L281 TraceCheckUtils]: 28: Hoare triple {16453#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {16457#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:32:42,866 INFO L281 TraceCheckUtils]: 29: Hoare triple {16457#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !false; {16457#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:32:42,866 INFO L281 TraceCheckUtils]: 30: Hoare triple {16457#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(main_~c~0 >= main_~b~0); {16457#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:32:42,867 INFO L281 TraceCheckUtils]: 31: Hoare triple {16457#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~k~0 1))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} is VALID [2021-09-13 14:32:42,867 INFO L281 TraceCheckUtils]: 32: Hoare triple {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} assume !false; {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} is VALID [2021-09-13 14:32:42,868 INFO L281 TraceCheckUtils]: 33: Hoare triple {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} is VALID [2021-09-13 14:32:42,868 INFO L281 TraceCheckUtils]: 34: Hoare triple {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} assume !false; {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} is VALID [2021-09-13 14:32:42,869 INFO L281 TraceCheckUtils]: 35: Hoare triple {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} is VALID [2021-09-13 14:32:42,870 INFO L281 TraceCheckUtils]: 36: Hoare triple {16467#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16483#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:42,870 INFO L281 TraceCheckUtils]: 37: Hoare triple {16483#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {16487#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:32:42,871 INFO L281 TraceCheckUtils]: 38: Hoare triple {16487#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0)) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16491#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:32:42,871 INFO L281 TraceCheckUtils]: 39: Hoare triple {16491#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {16360#false} is VALID [2021-09-13 14:32:42,871 INFO L281 TraceCheckUtils]: 40: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2021-09-13 14:32:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:32:42,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:44,355 INFO L281 TraceCheckUtils]: 40: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2021-09-13 14:32:44,356 INFO L281 TraceCheckUtils]: 39: Hoare triple {16491#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {16360#false} is VALID [2021-09-13 14:32:44,356 INFO L281 TraceCheckUtils]: 38: Hoare triple {16504#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16491#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:32:44,357 INFO L281 TraceCheckUtils]: 37: Hoare triple {16508#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {16504#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:32:44,357 INFO L281 TraceCheckUtils]: 36: Hoare triple {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16508#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:32:44,357 INFO L281 TraceCheckUtils]: 35: Hoare triple {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,358 INFO L281 TraceCheckUtils]: 34: Hoare triple {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false; {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,358 INFO L281 TraceCheckUtils]: 33: Hoare triple {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,358 INFO L281 TraceCheckUtils]: 32: Hoare triple {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false; {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,567 INFO L281 TraceCheckUtils]: 31: Hoare triple {16528#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {16512#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,568 INFO L281 TraceCheckUtils]: 30: Hoare triple {16528#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)))} assume !(main_~c~0 >= main_~b~0); {16528#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)))} is VALID [2021-09-13 14:32:44,568 INFO L281 TraceCheckUtils]: 29: Hoare triple {16528#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)))} assume !false; {16528#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)))} is VALID [2021-09-13 14:32:44,573 INFO L281 TraceCheckUtils]: 28: Hoare triple {16538#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {16528#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)))} is VALID [2021-09-13 14:32:44,574 INFO L281 TraceCheckUtils]: 27: Hoare triple {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} assume !(main_~c~0 >= 2 * main_~v~0); {16538#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:32:44,574 INFO L281 TraceCheckUtils]: 26: Hoare triple {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} assume !(0 == __VERIFIER_assert_~cond); {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:44,574 INFO L281 TraceCheckUtils]: 25: Hoare triple {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:44,575 INFO L281 TraceCheckUtils]: 24: Hoare triple {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} assume !(0 == __VERIFIER_assert_~cond); {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:44,575 INFO L281 TraceCheckUtils]: 23: Hoare triple {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:44,575 INFO L281 TraceCheckUtils]: 22: Hoare triple {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} assume !(0 == __VERIFIER_assert_~cond); {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:44,576 INFO L281 TraceCheckUtils]: 21: Hoare triple {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:44,576 INFO L281 TraceCheckUtils]: 20: Hoare triple {16564#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {16542#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:44,577 INFO L281 TraceCheckUtils]: 19: Hoare triple {16568#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16564#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:32:44,577 INFO L281 TraceCheckUtils]: 18: Hoare triple {16572#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {16568#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~v~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,578 INFO L281 TraceCheckUtils]: 17: Hoare triple {16572#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false; {16572#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,578 INFO L281 TraceCheckUtils]: 16: Hoare triple {16359#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {16572#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:32:44,578 INFO L281 TraceCheckUtils]: 15: Hoare triple {16359#true} assume !false; {16359#true} is VALID [2021-09-13 14:32:44,578 INFO L281 TraceCheckUtils]: 14: Hoare triple {16359#true} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {16359#true} is VALID [2021-09-13 14:32:44,578 INFO L281 TraceCheckUtils]: 13: Hoare triple {16359#true} assume !(main_~c~0 >= main_~b~0); {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 12: Hoare triple {16359#true} assume !false; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 11: Hoare triple {16359#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 10: Hoare triple {16359#true} assume !false; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 9: Hoare triple {16359#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 8: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 7: Hoare triple {16359#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 6: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 5: Hoare triple {16359#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 4: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 3: Hoare triple {16359#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 2: Hoare triple {16359#true} assume !(0 == assume_abort_if_not_~cond); {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 1: Hoare triple {16359#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {16359#true} is VALID [2021-09-13 14:32:44,579 INFO L281 TraceCheckUtils]: 0: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {16359#true} is VALID [2021-09-13 14:32:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:32:44,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:32:44,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321419900] [2021-09-13 14:32:44,580 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:32:44,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341747198] [2021-09-13 14:32:44,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341747198] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:32:44,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:32:44,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2021-09-13 14:32:44,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046210375] [2021-09-13 14:32:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-09-13 14:32:44,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:44,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:32:44,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:44,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-09-13 14:32:44,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:32:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-09-13 14:32:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2021-09-13 14:32:44,705 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:05,925 INFO L93 Difference]: Finished difference Result 303 states and 339 transitions. [2021-09-13 14:33:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-09-13 14:33:05,925 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-09-13 14:33:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:33:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 184 transitions. [2021-09-13 14:33:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 184 transitions. [2021-09-13 14:33:05,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 184 transitions. [2021-09-13 14:33:06,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:33:06,420 INFO L225 Difference]: With dead ends: 303 [2021-09-13 14:33:06,421 INFO L226 Difference]: Without dead ends: 299 [2021-09-13 14:33:06,421 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 5104.40ms TimeCoverageRelationStatistics Valid=729, Invalid=2241, Unknown=0, NotChecked=0, Total=2970 [2021-09-13 14:33:06,423 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6979.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.52ms SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6993.20ms IncrementalHoareTripleChecker+Time [2021-09-13 14:33:06,423 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 1488 Unknown, 0 Unchecked, 5.52ms Time], IncrementalHoareTripleChecker [232 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 6993.20ms Time] [2021-09-13 14:33:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-09-13 14:33:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 213. [2021-09-13 14:33:07,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:33:07,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 213 states, 210 states have (on average 1.1238095238095238) internal successors, (236), 212 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:07,762 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 213 states, 210 states have (on average 1.1238095238095238) internal successors, (236), 212 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:07,762 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 213 states, 210 states have (on average 1.1238095238095238) internal successors, (236), 212 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:07,765 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2021-09-13 14:33:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 329 transitions. [2021-09-13 14:33:07,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:07,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:07,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 210 states have (on average 1.1238095238095238) internal successors, (236), 212 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 299 states. [2021-09-13 14:33:07,766 INFO L87 Difference]: Start difference. First operand has 213 states, 210 states have (on average 1.1238095238095238) internal successors, (236), 212 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 299 states. [2021-09-13 14:33:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:07,769 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2021-09-13 14:33:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 329 transitions. [2021-09-13 14:33:07,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:07,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:07,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:33:07,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:33:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 210 states have (on average 1.1238095238095238) internal successors, (236), 212 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 236 transitions. [2021-09-13 14:33:07,773 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 236 transitions. Word has length 41 [2021-09-13 14:33:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:33:07,773 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 236 transitions. [2021-09-13 14:33:07,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 236 transitions. [2021-09-13 14:33:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-09-13 14:33:07,774 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:33:07,774 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:33:07,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-09-13 14:33:07,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-09-13 14:33:07,989 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:33:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:33:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1976752845, now seen corresponding path program 1 times [2021-09-13 14:33:07,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:33:07,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634435510] [2021-09-13 14:33:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:33:07,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:33:07,994 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:33:07,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571782943] [2021-09-13 14:33:07,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:33:07,994 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:33:07,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:33:07,997 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:33:07,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-09-13 14:33:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:08,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 77 conjunts are in the unsatisfiable core [2021-09-13 14:33:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:08,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:33:09,662 INFO L281 TraceCheckUtils]: 0: Hoare triple {18039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 1: Hoare triple {18039#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 2: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 3: Hoare triple {18039#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 4: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 5: Hoare triple {18039#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 6: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 7: Hoare triple {18039#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:09,663 INFO L281 TraceCheckUtils]: 8: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:09,664 INFO L281 TraceCheckUtils]: 9: Hoare triple {18039#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {18071#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:33:09,664 INFO L281 TraceCheckUtils]: 10: Hoare triple {18071#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {18071#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:33:09,665 INFO L281 TraceCheckUtils]: 11: Hoare triple {18071#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {18078#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:33:09,665 INFO L281 TraceCheckUtils]: 12: Hoare triple {18078#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {18078#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:33:09,665 INFO L281 TraceCheckUtils]: 13: Hoare triple {18078#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {18078#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:33:09,666 INFO L281 TraceCheckUtils]: 14: Hoare triple {18078#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18088#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,666 INFO L281 TraceCheckUtils]: 15: Hoare triple {18088#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !false; {18088#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,667 INFO L281 TraceCheckUtils]: 16: Hoare triple {18088#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {18095#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,667 INFO L281 TraceCheckUtils]: 17: Hoare triple {18095#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !false; {18095#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,667 INFO L281 TraceCheckUtils]: 18: Hoare triple {18095#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,668 INFO L281 TraceCheckUtils]: 19: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,668 INFO L281 TraceCheckUtils]: 20: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,669 INFO L281 TraceCheckUtils]: 21: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,669 INFO L281 TraceCheckUtils]: 22: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,670 INFO L281 TraceCheckUtils]: 23: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,670 INFO L281 TraceCheckUtils]: 24: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,670 INFO L281 TraceCheckUtils]: 25: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,671 INFO L281 TraceCheckUtils]: 26: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,671 INFO L281 TraceCheckUtils]: 27: Hoare triple {18102#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {18130#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,672 INFO L281 TraceCheckUtils]: 28: Hoare triple {18130#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18134#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,672 INFO L281 TraceCheckUtils]: 29: Hoare triple {18134#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,673 INFO L281 TraceCheckUtils]: 30: Hoare triple {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18134#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,673 INFO L281 TraceCheckUtils]: 31: Hoare triple {18134#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,673 INFO L281 TraceCheckUtils]: 32: Hoare triple {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,674 INFO L281 TraceCheckUtils]: 33: Hoare triple {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,674 INFO L281 TraceCheckUtils]: 34: Hoare triple {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,675 INFO L281 TraceCheckUtils]: 35: Hoare triple {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,675 INFO L281 TraceCheckUtils]: 36: Hoare triple {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(main_~c~0 >= 2 * main_~v~0); {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,676 INFO L281 TraceCheckUtils]: 37: Hoare triple {18138#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~d~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {18163#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~k~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,676 INFO L281 TraceCheckUtils]: 38: Hoare triple {18163#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~k~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !false; {18163#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~k~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,677 INFO L281 TraceCheckUtils]: 39: Hoare triple {18163#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~k~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(main_~c~0 >= main_~b~0); {18163#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~k~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:33:09,677 INFO L281 TraceCheckUtils]: 40: Hoare triple {18163#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~k~0 2) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18173#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 ULTIMATE.start_main_~a~0))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:33:09,678 INFO L281 TraceCheckUtils]: 41: Hoare triple {18173#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 ULTIMATE.start_main_~a~0))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !false; {18173#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 ULTIMATE.start_main_~a~0))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:33:09,678 INFO L281 TraceCheckUtils]: 42: Hoare triple {18173#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 ULTIMATE.start_main_~a~0))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 != main_~b~0); {18180#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~y~0 (* 2 ULTIMATE.start_main_~a~0)) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:33:09,678 INFO L281 TraceCheckUtils]: 43: Hoare triple {18180#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~y~0 (* 2 ULTIMATE.start_main_~a~0)) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18184#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:33:09,679 INFO L281 TraceCheckUtils]: 44: Hoare triple {18184#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {18040#false} is VALID [2021-09-13 14:33:09,679 INFO L281 TraceCheckUtils]: 45: Hoare triple {18040#false} assume !false; {18040#false} is VALID [2021-09-13 14:33:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:33:09,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:33:12,272 INFO L281 TraceCheckUtils]: 45: Hoare triple {18040#false} assume !false; {18040#false} is VALID [2021-09-13 14:33:12,273 INFO L281 TraceCheckUtils]: 44: Hoare triple {18184#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {18040#false} is VALID [2021-09-13 14:33:12,273 INFO L281 TraceCheckUtils]: 43: Hoare triple {18197#(= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)))} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18184#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:33:12,274 INFO L281 TraceCheckUtils]: 42: Hoare triple {18201#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 != main_~b~0); {18197#(= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:33:12,274 INFO L281 TraceCheckUtils]: 41: Hoare triple {18201#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !false; {18201#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:33:13,431 INFO L281 TraceCheckUtils]: 40: Hoare triple {18208#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18201#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:33:13,431 INFO L281 TraceCheckUtils]: 39: Hoare triple {18208#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !(main_~c~0 >= main_~b~0); {18208#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:33:13,432 INFO L281 TraceCheckUtils]: 38: Hoare triple {18208#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !false; {18208#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:33:13,507 INFO L281 TraceCheckUtils]: 37: Hoare triple {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {18208#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:33:13,508 INFO L281 TraceCheckUtils]: 36: Hoare triple {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(main_~c~0 >= 2 * main_~v~0); {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,508 INFO L281 TraceCheckUtils]: 35: Hoare triple {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,508 INFO L281 TraceCheckUtils]: 34: Hoare triple {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,508 INFO L281 TraceCheckUtils]: 33: Hoare triple {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,509 INFO L281 TraceCheckUtils]: 32: Hoare triple {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,509 INFO L281 TraceCheckUtils]: 31: Hoare triple {18237#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {18218#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,510 INFO L281 TraceCheckUtils]: 30: Hoare triple {18241#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18237#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,510 INFO L281 TraceCheckUtils]: 29: Hoare triple {18245#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {18241#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,511 INFO L281 TraceCheckUtils]: 28: Hoare triple {18249#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18245#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:33:13,642 INFO L281 TraceCheckUtils]: 27: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {18249#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,643 INFO L281 TraceCheckUtils]: 26: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,643 INFO L281 TraceCheckUtils]: 25: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,644 INFO L281 TraceCheckUtils]: 24: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,644 INFO L281 TraceCheckUtils]: 23: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,644 INFO L281 TraceCheckUtils]: 22: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,657 INFO L281 TraceCheckUtils]: 21: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,657 INFO L281 TraceCheckUtils]: 20: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,658 INFO L281 TraceCheckUtils]: 19: Hoare triple {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,658 INFO L281 TraceCheckUtils]: 18: Hoare triple {18281#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 3 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 3 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {18253#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,659 INFO L281 TraceCheckUtils]: 17: Hoare triple {18281#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 3 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 3 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !false; {18281#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 3 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 3 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,660 INFO L281 TraceCheckUtils]: 16: Hoare triple {18039#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {18281#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 3 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 3 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (not (= ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:33:13,660 INFO L281 TraceCheckUtils]: 15: Hoare triple {18039#true} assume !false; {18039#true} is VALID [2021-09-13 14:33:13,660 INFO L281 TraceCheckUtils]: 14: Hoare triple {18039#true} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18039#true} is VALID [2021-09-13 14:33:13,660 INFO L281 TraceCheckUtils]: 13: Hoare triple {18039#true} assume !(main_~c~0 >= main_~b~0); {18039#true} is VALID [2021-09-13 14:33:13,660 INFO L281 TraceCheckUtils]: 12: Hoare triple {18039#true} assume !false; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 11: Hoare triple {18039#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 10: Hoare triple {18039#true} assume !false; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 9: Hoare triple {18039#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 8: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 7: Hoare triple {18039#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 6: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 5: Hoare triple {18039#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 4: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 3: Hoare triple {18039#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 2: Hoare triple {18039#true} assume !(0 == assume_abort_if_not_~cond); {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 1: Hoare triple {18039#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18039#true} is VALID [2021-09-13 14:33:13,661 INFO L281 TraceCheckUtils]: 0: Hoare triple {18039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {18039#true} is VALID [2021-09-13 14:33:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:33:13,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:33:13,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634435510] [2021-09-13 14:33:13,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:33:13,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571782943] [2021-09-13 14:33:13,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571782943] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:33:13,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:33:13,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-09-13 14:33:13,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107946205] [2021-09-13 14:33:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-09-13 14:33:13,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:33:13,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:14,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:33:14,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-09-13 14:33:14,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:33:14,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-09-13 14:33:14,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2021-09-13 14:33:14,320 INFO L87 Difference]: Start difference. First operand 213 states and 236 transitions. Second operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:29,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:33:41,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:33:52,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:33:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:58,792 INFO L93 Difference]: Finished difference Result 601 states and 670 transitions. [2021-09-13 14:33:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-09-13 14:33:58,792 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-09-13 14:33:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:33:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 356 transitions. [2021-09-13 14:33:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:33:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 356 transitions. [2021-09-13 14:33:58,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 356 transitions. [2021-09-13 14:34:07,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 355 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:34:07,653 INFO L225 Difference]: With dead ends: 601 [2021-09-13 14:34:07,653 INFO L226 Difference]: Without dead ends: 595 [2021-09-13 14:34:07,655 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3026 ImplicationChecksByTransitivity, 14187.63ms TimeCoverageRelationStatistics Valid=1419, Invalid=8087, Unknown=0, NotChecked=0, Total=9506 [2021-09-13 14:34:07,655 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 641 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 388 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15452.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.44ms SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15474.24ms IncrementalHoareTripleChecker+Time [2021-09-13 14:34:07,655 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 0 Invalid, 1917 Unknown, 0 Unchecked, 8.44ms Time], IncrementalHoareTripleChecker [388 Valid, 1527 Invalid, 2 Unknown, 0 Unchecked, 15474.24ms Time] [2021-09-13 14:34:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-09-13 14:34:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 255. [2021-09-13 14:34:09,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:34:09,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 255 states, 252 states have (on average 1.126984126984127) internal successors, (284), 254 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:34:09,588 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 255 states, 252 states have (on average 1.126984126984127) internal successors, (284), 254 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:34:09,588 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 255 states, 252 states have (on average 1.126984126984127) internal successors, (284), 254 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:34:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:09,597 INFO L93 Difference]: Finished difference Result 595 states and 662 transitions. [2021-09-13 14:34:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 662 transitions. [2021-09-13 14:34:09,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:09,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:09,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 252 states have (on average 1.126984126984127) internal successors, (284), 254 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 595 states. [2021-09-13 14:34:09,599 INFO L87 Difference]: Start difference. First operand has 255 states, 252 states have (on average 1.126984126984127) internal successors, (284), 254 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 595 states. [2021-09-13 14:34:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:09,609 INFO L93 Difference]: Finished difference Result 595 states and 662 transitions. [2021-09-13 14:34:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 662 transitions. [2021-09-13 14:34:09,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:09,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:09,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:34:09,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:34:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 252 states have (on average 1.126984126984127) internal successors, (284), 254 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:34:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 284 transitions. [2021-09-13 14:34:09,614 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 284 transitions. Word has length 46 [2021-09-13 14:34:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:34:09,614 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 284 transitions. [2021-09-13 14:34:09,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:34:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 284 transitions. [2021-09-13 14:34:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-09-13 14:34:09,615 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:34:09,615 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:34:09,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-09-13 14:34:09,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-09-13 14:34:09,825 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:34:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:34:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 448462549, now seen corresponding path program 2 times [2021-09-13 14:34:09,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:34:09,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201889349] [2021-09-13 14:34:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:34:09,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:34:09,830 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:34:09,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531069968] [2021-09-13 14:34:09,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:34:09,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:34:09,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:34:09,832 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:34:09,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-09-13 14:34:09,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:34:09,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:34:09,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 77 conjunts are in the unsatisfiable core [2021-09-13 14:34:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:09,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:35:03,639 INFO L281 TraceCheckUtils]: 0: Hoare triple {20938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 1: Hoare triple {20938#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 2: Hoare triple {20938#true} assume !(0 == assume_abort_if_not_~cond); {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 3: Hoare triple {20938#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 4: Hoare triple {20938#true} assume !(0 == assume_abort_if_not_~cond); {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 5: Hoare triple {20938#true} assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 6: Hoare triple {20938#true} assume !(0 == assume_abort_if_not_~cond); {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 7: Hoare triple {20938#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {20938#true} is VALID [2021-09-13 14:35:03,640 INFO L281 TraceCheckUtils]: 8: Hoare triple {20938#true} assume !(0 == assume_abort_if_not_~cond); {20938#true} is VALID [2021-09-13 14:35:03,641 INFO L281 TraceCheckUtils]: 9: Hoare triple {20938#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {20970#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,641 INFO L281 TraceCheckUtils]: 10: Hoare triple {20970#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {20970#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,642 INFO L281 TraceCheckUtils]: 11: Hoare triple {20970#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {20977#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,642 INFO L281 TraceCheckUtils]: 12: Hoare triple {20977#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {20977#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,643 INFO L281 TraceCheckUtils]: 13: Hoare triple {20977#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,643 INFO L281 TraceCheckUtils]: 14: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,644 INFO L281 TraceCheckUtils]: 15: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,644 INFO L281 TraceCheckUtils]: 16: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,645 INFO L281 TraceCheckUtils]: 17: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,645 INFO L281 TraceCheckUtils]: 18: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,645 INFO L281 TraceCheckUtils]: 19: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,646 INFO L281 TraceCheckUtils]: 20: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,646 INFO L281 TraceCheckUtils]: 21: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,648 INFO L281 TraceCheckUtils]: 22: Hoare triple {20984#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,649 INFO L281 TraceCheckUtils]: 23: Hoare triple {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,649 INFO L281 TraceCheckUtils]: 24: Hoare triple {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,650 INFO L281 TraceCheckUtils]: 25: Hoare triple {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,651 INFO L281 TraceCheckUtils]: 26: Hoare triple {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,651 INFO L281 TraceCheckUtils]: 27: Hoare triple {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,652 INFO L281 TraceCheckUtils]: 28: Hoare triple {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,653 INFO L281 TraceCheckUtils]: 29: Hoare triple {21012#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21034#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (or (and (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,653 INFO L281 TraceCheckUtils]: 30: Hoare triple {21034#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (or (and (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21038#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,654 INFO L281 TraceCheckUtils]: 31: Hoare triple {21038#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= 2 * main_~v~0); {21038#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,656 INFO L281 TraceCheckUtils]: 32: Hoare triple {21038#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {21045#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,657 INFO L281 TraceCheckUtils]: 33: Hoare triple {21045#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {21045#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,658 INFO L281 TraceCheckUtils]: 34: Hoare triple {21045#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,659 INFO L281 TraceCheckUtils]: 35: Hoare triple {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,660 INFO L281 TraceCheckUtils]: 36: Hoare triple {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,660 INFO L281 TraceCheckUtils]: 37: Hoare triple {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21062#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,661 INFO L281 TraceCheckUtils]: 38: Hoare triple {21062#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,663 INFO L281 TraceCheckUtils]: 39: Hoare triple {21052#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21069#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,664 INFO L281 TraceCheckUtils]: 40: Hoare triple {21069#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21073#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,664 INFO L281 TraceCheckUtils]: 41: Hoare triple {21073#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21069#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,665 INFO L281 TraceCheckUtils]: 42: Hoare triple {21069#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {21073#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,665 INFO L281 TraceCheckUtils]: 43: Hoare triple {21073#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= 2 * main_~v~0); {21073#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,668 INFO L281 TraceCheckUtils]: 44: Hoare triple {21073#(and (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= (* 2 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {21086#(and (= ULTIMATE.start_main_~p~0 1) (= (mod (+ ULTIMATE.start_main_~k~0 1) (- 2)) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= (* 3 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,669 INFO L281 TraceCheckUtils]: 45: Hoare triple {21086#(and (= ULTIMATE.start_main_~p~0 1) (= (mod (+ ULTIMATE.start_main_~k~0 1) (- 2)) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= (* 3 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {21086#(and (= ULTIMATE.start_main_~p~0 1) (= (mod (+ ULTIMATE.start_main_~k~0 1) (- 2)) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= (* 3 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,669 INFO L281 TraceCheckUtils]: 46: Hoare triple {21086#(and (= ULTIMATE.start_main_~p~0 1) (= (mod (+ ULTIMATE.start_main_~k~0 1) (- 2)) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= (* 3 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {21086#(and (= ULTIMATE.start_main_~p~0 1) (= (mod (+ ULTIMATE.start_main_~k~0 1) (- 2)) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= (* 3 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:03,670 INFO L281 TraceCheckUtils]: 47: Hoare triple {21086#(and (= ULTIMATE.start_main_~p~0 1) (= (mod (+ ULTIMATE.start_main_~k~0 1) (- 2)) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= (* 3 ULTIMATE.start_main_~b~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {21096#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (mod (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0 1) (- 2)) 0) (= (div (+ ULTIMATE.start_main_~p~0 (* ULTIMATE.start_main_~q~0 (- 1)) 1) (- 2)) 0) (= ULTIMATE.start_main_~r~0 1))} is VALID [2021-09-13 14:35:03,671 INFO L281 TraceCheckUtils]: 48: Hoare triple {21096#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (mod (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0 1) (- 2)) 0) (= (div (+ ULTIMATE.start_main_~p~0 (* ULTIMATE.start_main_~q~0 (- 1)) 1) (- 2)) 0) (= ULTIMATE.start_main_~r~0 1))} assume !false; {21096#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (mod (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0 1) (- 2)) 0) (= (div (+ ULTIMATE.start_main_~p~0 (* ULTIMATE.start_main_~q~0 (- 1)) 1) (- 2)) 0) (= ULTIMATE.start_main_~r~0 1))} is VALID [2021-09-13 14:35:03,671 INFO L281 TraceCheckUtils]: 49: Hoare triple {21096#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (mod (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0 1) (- 2)) 0) (= (div (+ ULTIMATE.start_main_~p~0 (* ULTIMATE.start_main_~q~0 (- 1)) 1) (- 2)) 0) (= ULTIMATE.start_main_~r~0 1))} assume !(0 != main_~b~0); {21096#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (mod (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0 1) (- 2)) 0) (= (div (+ ULTIMATE.start_main_~p~0 (* ULTIMATE.start_main_~q~0 (- 1)) 1) (- 2)) 0) (= ULTIMATE.start_main_~r~0 1))} is VALID [2021-09-13 14:35:03,672 INFO L281 TraceCheckUtils]: 50: Hoare triple {21096#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (mod (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0 1) (- 2)) 0) (= (div (+ ULTIMATE.start_main_~p~0 (* ULTIMATE.start_main_~q~0 (- 1)) 1) (- 2)) 0) (= ULTIMATE.start_main_~r~0 1))} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21106#(<= 0 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:35:03,672 INFO L281 TraceCheckUtils]: 51: Hoare triple {21106#(<= 0 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {20938#true} is VALID [2021-09-13 14:35:03,672 INFO L281 TraceCheckUtils]: 52: Hoare triple {20938#true} assume !false; {20939#false} is INVALID [2021-09-13 14:35:03,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:35:03,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201889349] [2021-09-13 14:35:03,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:35:03,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531069968] [2021-09-13 14:35:03,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: invalid Hoare triple in FP [2021-09-13 14:35:03,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:35:03,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-09-13 14:35:03,674 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-09-13 14:35:03,674 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-09-13 14:35:03,677 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-09-13 14:35:03,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-09-13 14:35:03,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-09-13 14:35:03,679 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-09-13 14:35:03,680 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-09-13 14:35:03,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-09-13 14:35:03,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:35:03,898 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:35:03,918 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:35:03,918 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:35:03,918 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:35:03,918 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:35:03,918 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:35:03,918 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:35:03,918 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2021-09-13 14:35:03,919 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L11-14 has no Hoare annotation [2021-09-13 14:35:03,920 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:35:03,921 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:35:03,922 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:35:03,923 WARN L170 areAnnotationChecker]: L11-8 has no Hoare annotation [2021-09-13 14:35:03,923 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:35:03,923 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:35:03,923 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:35:03,923 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:35:03,923 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:35:03,923 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:35:03,923 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:35:03,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:35:03 BoogieIcfgContainer [2021-09-13 14:35:03,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:35:03,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:35:03,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:35:03,925 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:35:03,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:26:56" (3/4) ... [2021-09-13 14:35:03,928 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-09-13 14:35:03,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:35:03,929 INFO L158 Benchmark]: Toolchain (without parser) took 488430.83ms. Allocated memory was 50.3MB in the beginning and 119.5MB in the end (delta: 69.2MB). Free memory was 28.5MB in the beginning and 52.6MB in the end (delta: -24.2MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2021-09-13 14:35:03,929 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:35:03,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.59ms. Allocated memory is still 50.3MB. Free memory was 28.3MB in the beginning and 28.9MB in the end (delta: -607.5kB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2021-09-13 14:35:03,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.12ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 28.9MB in the beginning and 50.5MB in the end (delta: -21.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:35:03,929 INFO L158 Benchmark]: Boogie Preprocessor took 42.18ms. Allocated memory is still 67.1MB. Free memory was 50.5MB in the beginning and 49.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:35:03,929 INFO L158 Benchmark]: RCFGBuilder took 272.69ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 37.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:35:03,930 INFO L158 Benchmark]: TraceAbstraction took 487893.19ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 37.5MB in the beginning and 53.7MB in the end (delta: -16.2MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2021-09-13 14:35:03,930 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 119.5MB. Free memory was 53.7MB in the beginning and 52.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:35:03,930 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.16ms. Allocated memory is still 50.3MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.59ms. Allocated memory is still 50.3MB. Free memory was 28.3MB in the beginning and 28.9MB in the end (delta: -607.5kB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.12ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 28.9MB in the beginning and 50.5MB in the end (delta: -21.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.18ms. Allocated memory is still 67.1MB. Free memory was 50.5MB in the beginning and 49.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.69ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 37.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 487893.19ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 37.5MB in the beginning and 53.7MB in the end (delta: -16.2MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 119.5MB. Free memory was 53.7MB in the beginning and 52.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] int x, y; [L20] long long a, b, p, q, r, s; [L21] x = __VERIFIER_nondet_int() [L8] COND FALSE !(!cond) [L23] y = __VERIFIER_nondet_int() [L8] COND FALSE !(!cond) [L8] COND FALSE !(!cond) [L8] COND FALSE !(!cond) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 [L32] r = 0 [L33] s = 1 [L35] COND TRUE 1 [L36] COND FALSE !(!(b != 0)) [L38] long long c, k; [L39] c = a [L40] k = 0 [L42] COND TRUE 1 [L43] COND FALSE !(!(c >= b)) [L45] long long d, v; [L46] d = 1 [L47] v = b [L49] COND TRUE 1 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L55] COND FALSE !(!(c >= 2 * v)) [L57] d = 2 * d [L58] v = 2 * v [L49] COND TRUE 1 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L55] COND TRUE !(c >= 2 * v) [L60] c = c - v [L61] k = k + d [L42] COND TRUE 1 [L43] COND FALSE !(!(c >= b)) [L45] long long d, v; [L46] d = 1 [L47] v = b [L49] COND TRUE 1 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L55] COND TRUE !(c >= 2 * v) [L60] c = c - v [L61] k = k + d [L42] COND TRUE 1 [L43] COND TRUE !(c >= b) [L64] a = b [L65] b = c [L66] long long temp; [L67] temp = p [L68] p = q [L69] q = temp - q * k [L70] temp = r [L71] r = s [L72] s = temp - s * k [L35] COND TRUE 1 [L36] COND TRUE !(b != 0) [L11] COND TRUE !(cond) [L13] reach_error() - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 487796.18ms, OverallIterations: 19, TraceHistogramMax: 4, EmptinessCheckTime: 17.91ms, AutomataDifference: 125972.81ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 19.92ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 3108 SdHoareTripleChecker+Valid, 35237.26ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3108 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 35152.55ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 194 IncrementalHoareTripleChecker+Unchecked, 3080 mSDsCounter, 1017 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7124 IncrementalHoareTripleChecker+Invalid, 8337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1017 mSolverCounterUnsat, 0 mSDtfsCounter, 7124 mSolverCounterSat, 48.08ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1038 GetRequests, 650 SyntacticMatches, 10 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6107 ImplicationChecksByTransitivity, 30018.28ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=12, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 10134.29ms AutomataMinimizationTime, 18 MinimizatonAttempts, 1201 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 96.80ms SsaConstructionTime, 261.96ms SatisfiabilityAnalysisTime, 289651.41ms InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 784 ConstructedInterpolants, 12 QuantifiedInterpolants, 8312 SizeOfPredicates, 166 NumberOfNonLiveVariables, 2148 ConjunctsInSsa, 411 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 117/237 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-09-13 14:35:04,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:35:05,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:35:05,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:35:05,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:35:05,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:35:05,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:35:05,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:35:05,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:35:05,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:35:05,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:35:05,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:35:05,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:35:05,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:35:05,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:35:05,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:35:05,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:35:05,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:35:05,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:35:05,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:35:05,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:35:05,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:35:05,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:35:05,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:35:05,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:35:05,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:35:05,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:35:05,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:35:05,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:35:05,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:35:05,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:35:05,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:35:05,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:35:05,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:35:05,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:35:05,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:35:05,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:35:05,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:35:05,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:35:05,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:35:05,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:35:05,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:35:05,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-09-13 14:35:05,707 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:35:05,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:35:05,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:35:05,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:35:05,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:35:05,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:35:05,710 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:35:05,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:35:05,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:35:05,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:35:05,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:35:05,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:35:05,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:35:05,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:35:05,712 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:35:05,720 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:35:05,720 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:35:05,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:35:05,720 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:35:05,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:35:05,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:35:05,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:35:05,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:35:05,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:35:05,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:35:05,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:35:05,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:35:05,722 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:35:05,722 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:35:05,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:35:05,722 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:35:05,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:35:05,723 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 -> c7cbe6ad395b0d81984b9de528b8d735c1f87c97 [2021-09-13 14:35:06,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:35:06,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:35:06,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:35:06,087 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:35:06,088 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:35:06,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c [2021-09-13 14:35:06,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fb43abd/69c4363f874c4000b2d70785f264c2fd/FLAGe4db4b02f [2021-09-13 14:35:06,551 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:35:06,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c [2021-09-13 14:35:06,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fb43abd/69c4363f874c4000b2d70785f264c2fd/FLAGe4db4b02f [2021-09-13 14:35:06,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fb43abd/69c4363f874c4000b2d70785f264c2fd [2021-09-13 14:35:06,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:35:06,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:35:06,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:35:06,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:35:07,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:35:07,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:35:06" (1/1) ... [2021-09-13 14:35:07,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a2c974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07, skipping insertion in model container [2021-09-13 14:35:07,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:35:06" (1/1) ... [2021-09-13 14:35:07,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:35:07,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:35:07,131 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c[490,503] [2021-09-13 14:35:07,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:35:07,162 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:35:07,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound5.c[490,503] [2021-09-13 14:35:07,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:35:07,212 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:35:07,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07 WrapperNode [2021-09-13 14:35:07,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:35:07,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:35:07,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:35:07,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:35:07,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:35:07,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:35:07,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:35:07,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:35:07,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:35:07,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:35:07,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:35:07,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:35:07,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (1/1) ... [2021-09-13 14:35:07,286 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:35:07,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:35:07,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:35:07,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:35:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:35:07,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:35:07,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:35:07,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:35:11,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:35:11,602 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-09-13 14:35:11,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:35:11 BoogieIcfgContainer [2021-09-13 14:35:11,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:35:11,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:35:11,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:35:11,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:35:11,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:35:06" (1/3) ... [2021-09-13 14:35:11,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d7b847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:35:11, skipping insertion in model container [2021-09-13 14:35:11,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:35:07" (2/3) ... [2021-09-13 14:35:11,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d7b847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:35:11, skipping insertion in model container [2021-09-13 14:35:11,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:35:11" (3/3) ... [2021-09-13 14:35:11,609 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound5.c [2021-09-13 14:35:11,613 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:35:11,613 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:35:11,658 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:35:11,663 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:35:11,663 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:35:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:35:11,684 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:35:11,685 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:35:11,686 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:35:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:35:11,695 INFO L82 PathProgramCache]: Analyzing trace with hash -174497841, now seen corresponding path program 1 times [2021-09-13 14:35:11,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:35:11,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734339471] [2021-09-13 14:35:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:35:11,707 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:35:11,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:35:11,709 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) [2021-09-13 14:35:11,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 14:35:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:11,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:35:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:11,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:35:11,968 INFO L281 TraceCheckUtils]: 0: Hoare triple {44#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {44#true} is VALID [2021-09-13 14:35:11,969 INFO L281 TraceCheckUtils]: 1: Hoare triple {44#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {44#true} is VALID [2021-09-13 14:35:11,969 INFO L281 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:11,970 INFO L281 TraceCheckUtils]: 3: Hoare triple {45#false} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:35:11,970 INFO L281 TraceCheckUtils]: 4: Hoare triple {45#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:11,970 INFO L281 TraceCheckUtils]: 5: Hoare triple {45#false} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:35:11,971 INFO L281 TraceCheckUtils]: 6: Hoare triple {45#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:11,971 INFO L281 TraceCheckUtils]: 7: Hoare triple {45#false} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:35:11,971 INFO L281 TraceCheckUtils]: 8: Hoare triple {45#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:11,972 INFO L281 TraceCheckUtils]: 9: Hoare triple {45#false} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {45#false} is VALID [2021-09-13 14:35:11,972 INFO L281 TraceCheckUtils]: 10: Hoare triple {45#false} assume false; {45#false} is VALID [2021-09-13 14:35:11,972 INFO L281 TraceCheckUtils]: 11: Hoare triple {45#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {45#false} is VALID [2021-09-13 14:35:11,973 INFO L281 TraceCheckUtils]: 12: Hoare triple {45#false} assume 0bv32 == __VERIFIER_assert_~cond; {45#false} is VALID [2021-09-13 14:35:11,973 INFO L281 TraceCheckUtils]: 13: Hoare triple {45#false} assume !false; {45#false} is VALID [2021-09-13 14:35:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:11,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:35:12,049 INFO L281 TraceCheckUtils]: 13: Hoare triple {45#false} assume !false; {45#false} is VALID [2021-09-13 14:35:12,050 INFO L281 TraceCheckUtils]: 12: Hoare triple {45#false} assume 0bv32 == __VERIFIER_assert_~cond; {45#false} is VALID [2021-09-13 14:35:12,051 INFO L281 TraceCheckUtils]: 11: Hoare triple {45#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {45#false} is VALID [2021-09-13 14:35:12,051 INFO L281 TraceCheckUtils]: 10: Hoare triple {45#false} assume false; {45#false} is VALID [2021-09-13 14:35:12,052 INFO L281 TraceCheckUtils]: 9: Hoare triple {45#false} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {45#false} is VALID [2021-09-13 14:35:12,052 INFO L281 TraceCheckUtils]: 8: Hoare triple {45#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:12,052 INFO L281 TraceCheckUtils]: 7: Hoare triple {45#false} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:35:12,053 INFO L281 TraceCheckUtils]: 6: Hoare triple {45#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:12,054 INFO L281 TraceCheckUtils]: 5: Hoare triple {45#false} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:35:12,054 INFO L281 TraceCheckUtils]: 4: Hoare triple {45#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:12,054 INFO L281 TraceCheckUtils]: 3: Hoare triple {45#false} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:35:12,055 INFO L281 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:35:12,055 INFO L281 TraceCheckUtils]: 1: Hoare triple {44#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {44#true} is VALID [2021-09-13 14:35:12,056 INFO L281 TraceCheckUtils]: 0: Hoare triple {44#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {44#true} is VALID [2021-09-13 14:35:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:12,057 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:35:12,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734339471] [2021-09-13 14:35:12,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734339471] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:35:12,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:35:12,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:35:12,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036207968] [2021-09-13 14:35:12,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:35:12,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:35:12,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:12,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:35:12,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:35:12,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:35:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:35:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:35:12,192 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:14,513 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2021-09-13 14:35:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:35:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:35:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:35:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:35:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:35:14,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:35:15,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:35:15,132 INFO L225 Difference]: With dead ends: 79 [2021-09-13 14:35:15,132 INFO L226 Difference]: Without dead ends: 37 [2021-09-13 14:35:15,134 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.17ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:35:15,137 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1021.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1023.33ms IncrementalHoareTripleChecker+Time [2021-09-13 14:35:15,137 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1023.33ms Time] [2021-09-13 14:35:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-09-13 14:35:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-09-13 14:35:15,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:35:15,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:15,158 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:15,158 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:15,160 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:35:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:35:15,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:35:15,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:35:15,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 14:35:15,162 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 14:35:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:15,163 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:35:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:35:15,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:35:15,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:35:15,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:35:15,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:35:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-09-13 14:35:15,167 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 14 [2021-09-13 14:35:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:35:15,167 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-09-13 14:35:15,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:35:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:35:15,168 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:35:15,169 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:35:15,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-09-13 14:35:15,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:35:15,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:35:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:35:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1454170515, now seen corresponding path program 1 times [2021-09-13 14:35:15,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:35:15,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627689206] [2021-09-13 14:35:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:35:15,381 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:35:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:35:15,382 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) [2021-09-13 14:35:15,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 14:35:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:15,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 14:35:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:15,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:35:16,132 INFO L281 TraceCheckUtils]: 0: Hoare triple {341#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {341#true} is VALID [2021-09-13 14:35:16,132 INFO L281 TraceCheckUtils]: 1: Hoare triple {341#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {341#true} is VALID [2021-09-13 14:35:16,132 INFO L281 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:35:16,134 INFO L281 TraceCheckUtils]: 3: Hoare triple {341#true} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {355#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:35:16,134 INFO L281 TraceCheckUtils]: 4: Hoare triple {355#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {359#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:16,135 INFO L281 TraceCheckUtils]: 5: Hoare triple {359#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {359#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:16,136 INFO L281 TraceCheckUtils]: 6: Hoare triple {359#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {359#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:16,136 INFO L281 TraceCheckUtils]: 7: Hoare triple {359#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {369#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} is VALID [2021-09-13 14:35:16,137 INFO L281 TraceCheckUtils]: 8: Hoare triple {369#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} assume !(0bv32 == assume_abort_if_not_~cond); {373#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:16,138 INFO L281 TraceCheckUtils]: 9: Hoare triple {373#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {377#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))))} is VALID [2021-09-13 14:35:16,139 INFO L281 TraceCheckUtils]: 10: Hoare triple {377#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))))} assume !false; {377#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))))} is VALID [2021-09-13 14:35:16,140 INFO L281 TraceCheckUtils]: 11: Hoare triple {377#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {342#false} is VALID [2021-09-13 14:35:16,140 INFO L281 TraceCheckUtils]: 12: Hoare triple {342#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {342#false} is VALID [2021-09-13 14:35:16,140 INFO L281 TraceCheckUtils]: 13: Hoare triple {342#false} assume 0bv32 == __VERIFIER_assert_~cond; {342#false} is VALID [2021-09-13 14:35:16,140 INFO L281 TraceCheckUtils]: 14: Hoare triple {342#false} assume !false; {342#false} is VALID [2021-09-13 14:35:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:16,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:35:16,381 INFO L281 TraceCheckUtils]: 14: Hoare triple {342#false} assume !false; {342#false} is VALID [2021-09-13 14:35:16,381 INFO L281 TraceCheckUtils]: 13: Hoare triple {342#false} assume 0bv32 == __VERIFIER_assert_~cond; {342#false} is VALID [2021-09-13 14:35:16,381 INFO L281 TraceCheckUtils]: 12: Hoare triple {342#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {342#false} is VALID [2021-09-13 14:35:16,382 INFO L281 TraceCheckUtils]: 11: Hoare triple {402#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {342#false} is VALID [2021-09-13 14:35:16,382 INFO L281 TraceCheckUtils]: 10: Hoare triple {402#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !false; {402#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:35:16,383 INFO L281 TraceCheckUtils]: 9: Hoare triple {409#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {402#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:35:16,384 INFO L281 TraceCheckUtils]: 8: Hoare triple {413#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {409#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:35:16,386 INFO L281 TraceCheckUtils]: 7: Hoare triple {341#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {413#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2021-09-13 14:35:16,386 INFO L281 TraceCheckUtils]: 6: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:35:16,386 INFO L281 TraceCheckUtils]: 5: Hoare triple {341#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {341#true} is VALID [2021-09-13 14:35:16,387 INFO L281 TraceCheckUtils]: 4: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:35:16,387 INFO L281 TraceCheckUtils]: 3: Hoare triple {341#true} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {341#true} is VALID [2021-09-13 14:35:16,387 INFO L281 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:35:16,387 INFO L281 TraceCheckUtils]: 1: Hoare triple {341#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {341#true} is VALID [2021-09-13 14:35:16,387 INFO L281 TraceCheckUtils]: 0: Hoare triple {341#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {341#true} is VALID [2021-09-13 14:35:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:16,388 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:35:16,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627689206] [2021-09-13 14:35:16,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627689206] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:35:16,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:35:16,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2021-09-13 14:35:16,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050373969] [2021-09-13 14:35:16,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-13 14:35:16,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:35:16,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:16,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:35:16,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:35:16,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:35:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:35:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:35:16,494 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:33,087 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2021-09-13 14:35:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:35:33,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-13 14:35:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:35:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2021-09-13 14:35:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2021-09-13 14:35:33,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2021-09-13 14:35:33,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:35:33,464 INFO L225 Difference]: With dead ends: 43 [2021-09-13 14:35:33,464 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:35:33,465 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 493.57ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:35:33,466 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7167.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.81ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 7173.97ms IncrementalHoareTripleChecker+Time [2021-09-13 14:35:33,466 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 4.81ms Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 38 Unchecked, 7173.97ms Time] [2021-09-13 14:35:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:35:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:35:33,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:35:33,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,472 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,473 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:33,474 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-09-13 14:35:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:35:33,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:35:33,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:35:33,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2021-09-13 14:35:33,475 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2021-09-13 14:35:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:33,476 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-09-13 14:35:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:35:33,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:35:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:35:33,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:35:33,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:35:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-09-13 14:35:33,479 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 15 [2021-09-13 14:35:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:35:33,479 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-09-13 14:35:33,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:35:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:35:33,480 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:35:33,480 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:35:33,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:35:33,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:35:33,705 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:35:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:35:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1580206288, now seen corresponding path program 1 times [2021-09-13 14:35:33,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:35:33,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925551470] [2021-09-13 14:35:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:35:33,706 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:35:33,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:35:33,711 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) [2021-09-13 14:35:33,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-09-13 14:35:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:33,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:35:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:33,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:35:35,198 INFO L281 TraceCheckUtils]: 0: Hoare triple {619#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {619#true} is VALID [2021-09-13 14:35:35,199 INFO L281 TraceCheckUtils]: 1: Hoare triple {619#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {627#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:35:35,200 INFO L281 TraceCheckUtils]: 2: Hoare triple {627#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {631#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,201 INFO L281 TraceCheckUtils]: 3: Hoare triple {631#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {635#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,202 INFO L281 TraceCheckUtils]: 4: Hoare triple {635#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {639#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,202 INFO L281 TraceCheckUtils]: 5: Hoare triple {639#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {643#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))))) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,203 INFO L281 TraceCheckUtils]: 6: Hoare triple {643#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))))) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {647#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,203 INFO L281 TraceCheckUtils]: 7: Hoare triple {647#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {647#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,204 INFO L281 TraceCheckUtils]: 8: Hoare triple {647#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {647#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,204 INFO L281 TraceCheckUtils]: 9: Hoare triple {647#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,205 INFO L281 TraceCheckUtils]: 10: Hoare triple {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,205 INFO L281 TraceCheckUtils]: 11: Hoare triple {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,206 INFO L281 TraceCheckUtils]: 12: Hoare triple {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,206 INFO L281 TraceCheckUtils]: 13: Hoare triple {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:35:35,207 INFO L281 TraceCheckUtils]: 14: Hoare triple {657#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {673#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:35:35,207 INFO L281 TraceCheckUtils]: 15: Hoare triple {673#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {620#false} is VALID [2021-09-13 14:35:35,207 INFO L281 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2021-09-13 14:35:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:35,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:35:43,139 INFO L281 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2021-09-13 14:35:43,139 INFO L281 TraceCheckUtils]: 15: Hoare triple {683#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {620#false} is VALID [2021-09-13 14:35:43,140 INFO L281 TraceCheckUtils]: 14: Hoare triple {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {683#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:35:43,141 INFO L281 TraceCheckUtils]: 13: Hoare triple {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:35:43,141 INFO L281 TraceCheckUtils]: 12: Hoare triple {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !false; {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:35:43,142 INFO L281 TraceCheckUtils]: 11: Hoare triple {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:35:43,142 INFO L281 TraceCheckUtils]: 10: Hoare triple {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !false; {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 9: Hoare triple {619#true} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {687#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 8: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 7: Hoare triple {619#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 6: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 5: Hoare triple {619#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 4: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 3: Hoare triple {619#true} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 2: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 1: Hoare triple {619#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {619#true} is VALID [2021-09-13 14:35:43,143 INFO L281 TraceCheckUtils]: 0: Hoare triple {619#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {619#true} is VALID [2021-09-13 14:35:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:43,144 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:35:43,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925551470] [2021-09-13 14:35:43,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925551470] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:35:43,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:35:43,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 4] imperfect sequences [] total 12 [2021-09-13 14:35:43,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26785522] [2021-09-13 14:35:43,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-09-13 14:35:43,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:35:43,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:35:43,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:35:43,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:35:43,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:35:43,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:35:43,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:35:43,456 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:23,734 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2021-09-13 14:36:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:36:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-09-13 14:36:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:36:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2021-09-13 14:36:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2021-09-13 14:36:23,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2021-09-13 14:36:24,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:24,979 INFO L225 Difference]: With dead ends: 71 [2021-09-13 14:36:24,980 INFO L226 Difference]: Without dead ends: 69 [2021-09-13 14:36:24,980 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4730.23ms TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:36:24,981 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16654.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.56ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16663.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:36:24,981 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 8.56ms Time], IncrementalHoareTripleChecker [19 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 16663.28ms Time] [2021-09-13 14:36:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-09-13 14:36:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2021-09-13 14:36:25,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:36:25,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:25,007 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:25,007 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:25,009 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-09-13 14:36:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-09-13 14:36:25,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:25,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:25,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2021-09-13 14:36:25,010 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2021-09-13 14:36:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:25,012 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-09-13 14:36:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-09-13 14:36:25,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:25,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:25,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:36:25,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:36:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2021-09-13 14:36:25,014 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2021-09-13 14:36:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:36:25,014 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2021-09-13 14:36:25,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2021-09-13 14:36:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:36:25,015 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:36:25,015 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:36:25,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:36:25,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:36:25,222 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:36:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:36:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1840022701, now seen corresponding path program 1 times [2021-09-13 14:36:25,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:36:25,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418577985] [2021-09-13 14:36:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:36:25,225 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:36:25,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:36:25,225 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) [2021-09-13 14:36:25,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-09-13 14:36:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:25,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:36:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:25,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:36:26,795 INFO L281 TraceCheckUtils]: 0: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {1034#true} is VALID [2021-09-13 14:36:26,796 INFO L281 TraceCheckUtils]: 1: Hoare triple {1034#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1042#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:36:26,797 INFO L281 TraceCheckUtils]: 2: Hoare triple {1042#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1046#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,800 INFO L281 TraceCheckUtils]: 3: Hoare triple {1046#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1050#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,801 INFO L281 TraceCheckUtils]: 4: Hoare triple {1050#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1054#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,802 INFO L281 TraceCheckUtils]: 5: Hoare triple {1054#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1054#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,802 INFO L281 TraceCheckUtils]: 6: Hoare triple {1054#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1054#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,803 INFO L281 TraceCheckUtils]: 7: Hoare triple {1054#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1064#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} is VALID [2021-09-13 14:36:26,804 INFO L281 TraceCheckUtils]: 8: Hoare triple {1064#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} assume !(0bv32 == assume_abort_if_not_~cond); {1068#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,804 INFO L281 TraceCheckUtils]: 9: Hoare triple {1068#(and (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,805 INFO L281 TraceCheckUtils]: 10: Hoare triple {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,805 INFO L281 TraceCheckUtils]: 11: Hoare triple {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,809 INFO L281 TraceCheckUtils]: 12: Hoare triple {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,809 INFO L281 TraceCheckUtils]: 13: Hoare triple {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,810 INFO L281 TraceCheckUtils]: 14: Hoare triple {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,811 INFO L281 TraceCheckUtils]: 15: Hoare triple {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:36:26,811 INFO L281 TraceCheckUtils]: 16: Hoare triple {1072#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1094#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:36:26,816 INFO L281 TraceCheckUtils]: 17: Hoare triple {1094#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1035#false} is VALID [2021-09-13 14:36:26,816 INFO L281 TraceCheckUtils]: 18: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2021-09-13 14:36:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:36:26,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:36:36,325 INFO L281 TraceCheckUtils]: 18: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2021-09-13 14:36:36,326 INFO L281 TraceCheckUtils]: 17: Hoare triple {1104#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1035#false} is VALID [2021-09-13 14:36:36,327 INFO L281 TraceCheckUtils]: 16: Hoare triple {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1104#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:36:36,327 INFO L281 TraceCheckUtils]: 15: Hoare triple {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,329 INFO L281 TraceCheckUtils]: 14: Hoare triple {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,329 INFO L281 TraceCheckUtils]: 13: Hoare triple {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,337 INFO L281 TraceCheckUtils]: 12: Hoare triple {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !false; {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,337 INFO L281 TraceCheckUtils]: 11: Hoare triple {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,338 INFO L281 TraceCheckUtils]: 10: Hoare triple {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !false; {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 9: Hoare triple {1034#true} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {1108#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 8: Hoare triple {1034#true} assume !(0bv32 == assume_abort_if_not_~cond); {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 7: Hoare triple {1034#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 6: Hoare triple {1034#true} assume !(0bv32 == assume_abort_if_not_~cond); {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 5: Hoare triple {1034#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 4: Hoare triple {1034#true} assume !(0bv32 == assume_abort_if_not_~cond); {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 3: Hoare triple {1034#true} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 2: Hoare triple {1034#true} assume !(0bv32 == assume_abort_if_not_~cond); {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 1: Hoare triple {1034#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1034#true} is VALID [2021-09-13 14:36:36,339 INFO L281 TraceCheckUtils]: 0: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {1034#true} is VALID [2021-09-13 14:36:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:36:36,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:36:36,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418577985] [2021-09-13 14:36:36,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418577985] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:36:36,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:36:36,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 4] imperfect sequences [] total 12 [2021-09-13 14:36:36,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785855918] [2021-09-13 14:36:36,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:36:36,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:36:36,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:36:37,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:37,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:36:37,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:36:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:36:37,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:36:37,117 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:07,365 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-09-13 14:37:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:37:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:37:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:37:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2021-09-13 14:37:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2021-09-13 14:37:07,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 76 transitions. [2021-09-13 14:37:08,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:37:08,515 INFO L225 Difference]: With dead ends: 69 [2021-09-13 14:37:08,515 INFO L226 Difference]: Without dead ends: 67 [2021-09-13 14:37:08,516 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 5553.00ms TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-09-13 14:37:08,516 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11854.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.53ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11860.20ms IncrementalHoareTripleChecker+Time [2021-09-13 14:37:08,516 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 283 Unknown, 0 Unchecked, 6.53ms Time], IncrementalHoareTripleChecker [35 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 11860.20ms Time] [2021-09-13 14:37:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-09-13 14:37:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2021-09-13 14:37:08,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:37:08,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:08,554 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:08,554 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:08,556 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-09-13 14:37:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-09-13 14:37:08,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:08,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:08,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 67 states. [2021-09-13 14:37:08,557 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 67 states. [2021-09-13 14:37:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:08,558 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-09-13 14:37:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-09-13 14:37:08,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:08,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:08,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:37:08,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:37:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-09-13 14:37:08,560 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 19 [2021-09-13 14:37:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:37:08,560 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-09-13 14:37:08,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-09-13 14:37:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:37:08,561 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:37:08,561 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:37:08,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:37:08,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:37:08,771 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:37:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:37:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1412177226, now seen corresponding path program 1 times [2021-09-13 14:37:08,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:37:08,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659094032] [2021-09-13 14:37:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:37:08,772 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:37:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:37:08,773 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) [2021-09-13 14:37:08,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-09-13 14:37:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:08,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:37:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:08,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:37:09,627 INFO L281 TraceCheckUtils]: 0: Hoare triple {1458#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {1458#true} is VALID [2021-09-13 14:37:09,628 INFO L281 TraceCheckUtils]: 1: Hoare triple {1458#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1466#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:37:09,628 INFO L281 TraceCheckUtils]: 2: Hoare triple {1466#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1470#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:09,629 INFO L281 TraceCheckUtils]: 3: Hoare triple {1470#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1470#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:09,629 INFO L281 TraceCheckUtils]: 4: Hoare triple {1470#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1470#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:09,630 INFO L281 TraceCheckUtils]: 5: Hoare triple {1470#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1480#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:09,630 INFO L281 TraceCheckUtils]: 6: Hoare triple {1480#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1484#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:09,631 INFO L281 TraceCheckUtils]: 7: Hoare triple {1484#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1484#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:09,631 INFO L281 TraceCheckUtils]: 8: Hoare triple {1484#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1484#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:09,633 INFO L281 TraceCheckUtils]: 9: Hoare triple {1484#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {1494#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} is VALID [2021-09-13 14:37:09,633 INFO L281 TraceCheckUtils]: 10: Hoare triple {1494#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} assume !false; {1494#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} is VALID [2021-09-13 14:37:09,634 INFO L281 TraceCheckUtils]: 11: Hoare triple {1494#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1501#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} is VALID [2021-09-13 14:37:09,634 INFO L281 TraceCheckUtils]: 12: Hoare triple {1501#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} assume !false; {1501#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} is VALID [2021-09-13 14:37:09,634 INFO L281 TraceCheckUtils]: 13: Hoare triple {1501#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} assume !~bvsge64(main_~c~0, main_~b~0); {1501#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} is VALID [2021-09-13 14:37:09,635 INFO L281 TraceCheckUtils]: 14: Hoare triple {1501#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {1511#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} is VALID [2021-09-13 14:37:09,635 INFO L281 TraceCheckUtils]: 15: Hoare triple {1511#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} assume !false; {1511#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} is VALID [2021-09-13 14:37:09,636 INFO L281 TraceCheckUtils]: 16: Hoare triple {1511#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {1459#false} is VALID [2021-09-13 14:37:09,636 INFO L281 TraceCheckUtils]: 17: Hoare triple {1459#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1459#false} is VALID [2021-09-13 14:37:09,637 INFO L281 TraceCheckUtils]: 18: Hoare triple {1459#false} assume 0bv32 == __VERIFIER_assert_~cond; {1459#false} is VALID [2021-09-13 14:37:09,637 INFO L281 TraceCheckUtils]: 19: Hoare triple {1459#false} assume !false; {1459#false} is VALID [2021-09-13 14:37:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:37:09,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:37:10,003 INFO L281 TraceCheckUtils]: 19: Hoare triple {1459#false} assume !false; {1459#false} is VALID [2021-09-13 14:37:10,004 INFO L281 TraceCheckUtils]: 18: Hoare triple {1459#false} assume 0bv32 == __VERIFIER_assert_~cond; {1459#false} is VALID [2021-09-13 14:37:10,004 INFO L281 TraceCheckUtils]: 17: Hoare triple {1459#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1459#false} is VALID [2021-09-13 14:37:10,004 INFO L281 TraceCheckUtils]: 16: Hoare triple {1536#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {1459#false} is VALID [2021-09-13 14:37:10,004 INFO L281 TraceCheckUtils]: 15: Hoare triple {1536#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !false; {1536#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:37:10,005 INFO L281 TraceCheckUtils]: 14: Hoare triple {1543#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {1536#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:37:10,005 INFO L281 TraceCheckUtils]: 13: Hoare triple {1543#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !~bvsge64(main_~c~0, main_~b~0); {1543#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:10,005 INFO L281 TraceCheckUtils]: 12: Hoare triple {1543#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !false; {1543#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:10,006 INFO L281 TraceCheckUtils]: 11: Hoare triple {1553#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1543#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:10,006 INFO L281 TraceCheckUtils]: 10: Hoare triple {1553#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} assume !false; {1553#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:37:10,007 INFO L281 TraceCheckUtils]: 9: Hoare triple {1560#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {1553#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:37:10,007 INFO L281 TraceCheckUtils]: 8: Hoare triple {1560#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {1560#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:37:10,007 INFO L281 TraceCheckUtils]: 7: Hoare triple {1560#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1560#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:37:10,008 INFO L281 TraceCheckUtils]: 6: Hoare triple {1570#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1560#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:37:10,008 INFO L281 TraceCheckUtils]: 5: Hoare triple {1458#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1570#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2021-09-13 14:37:10,009 INFO L281 TraceCheckUtils]: 4: Hoare triple {1458#true} assume !(0bv32 == assume_abort_if_not_~cond); {1458#true} is VALID [2021-09-13 14:37:10,009 INFO L281 TraceCheckUtils]: 3: Hoare triple {1458#true} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1458#true} is VALID [2021-09-13 14:37:10,009 INFO L281 TraceCheckUtils]: 2: Hoare triple {1458#true} assume !(0bv32 == assume_abort_if_not_~cond); {1458#true} is VALID [2021-09-13 14:37:10,009 INFO L281 TraceCheckUtils]: 1: Hoare triple {1458#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1458#true} is VALID [2021-09-13 14:37:10,009 INFO L281 TraceCheckUtils]: 0: Hoare triple {1458#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {1458#true} is VALID [2021-09-13 14:37:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:37:10,009 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:37:10,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659094032] [2021-09-13 14:37:10,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659094032] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:37:10,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:37:10,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2021-09-13 14:37:10,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060127701] [2021-09-13 14:37:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 14:37:10,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:37:10,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:10,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:37:10,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:37:10,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:37:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:37:10,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:37:10,305 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:29,440 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-09-13 14:37:29,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:37:29,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 14:37:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:37:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2021-09-13 14:37:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2021-09-13 14:37:29,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2021-09-13 14:37:29,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:37:29,920 INFO L225 Difference]: With dead ends: 60 [2021-09-13 14:37:29,920 INFO L226 Difference]: Without dead ends: 56 [2021-09-13 14:37:29,920 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 673.38ms TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:37:29,921 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9049.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.57ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 9053.07ms IncrementalHoareTripleChecker+Time [2021-09-13 14:37:29,921 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 257 Unknown, 0 Unchecked, 2.57ms Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 8 Unchecked, 9053.07ms Time] [2021-09-13 14:37:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-09-13 14:37:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-09-13 14:37:29,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:37:29,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,957 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,957 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:29,958 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-09-13 14:37:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-09-13 14:37:29,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:29,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:29,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2021-09-13 14:37:29,959 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2021-09-13 14:37:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:29,960 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-09-13 14:37:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-09-13 14:37:29,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:29,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:29,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:37:29,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:37:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-09-13 14:37:29,962 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 20 [2021-09-13 14:37:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:37:29,962 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-09-13 14:37:29,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-09-13 14:37:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-13 14:37:29,963 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:37:29,963 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:37:29,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:37:30,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:37:30,176 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:37:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:37:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1264867958, now seen corresponding path program 1 times [2021-09-13 14:37:30,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:37:30,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249579376] [2021-09-13 14:37:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:37:30,177 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:37:30,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:37:30,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:37:30,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-09-13 14:37:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:30,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:37:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:30,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:37:31,567 INFO L281 TraceCheckUtils]: 0: Hoare triple {1854#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {1854#true} is VALID [2021-09-13 14:37:31,568 INFO L281 TraceCheckUtils]: 1: Hoare triple {1854#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1862#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:37:31,569 INFO L281 TraceCheckUtils]: 2: Hoare triple {1862#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1866#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:31,569 INFO L281 TraceCheckUtils]: 3: Hoare triple {1866#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1870#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:31,570 INFO L281 TraceCheckUtils]: 4: Hoare triple {1870#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1874#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:31,571 INFO L281 TraceCheckUtils]: 5: Hoare triple {1874#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1878#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))))) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:31,571 INFO L281 TraceCheckUtils]: 6: Hoare triple {1878#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))))) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1882#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:31,572 INFO L281 TraceCheckUtils]: 7: Hoare triple {1882#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1882#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:31,572 INFO L281 TraceCheckUtils]: 8: Hoare triple {1882#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1882#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:37:31,573 INFO L281 TraceCheckUtils]: 9: Hoare triple {1882#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {1892#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,574 INFO L281 TraceCheckUtils]: 10: Hoare triple {1892#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} assume !false; {1892#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,574 INFO L281 TraceCheckUtils]: 11: Hoare triple {1892#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,575 INFO L281 TraceCheckUtils]: 12: Hoare triple {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} assume !false; {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,575 INFO L281 TraceCheckUtils]: 13: Hoare triple {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,576 INFO L281 TraceCheckUtils]: 14: Hoare triple {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,577 INFO L281 TraceCheckUtils]: 15: Hoare triple {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} assume !(0bv32 == __VERIFIER_assert_~cond); {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,577 INFO L281 TraceCheckUtils]: 16: Hoare triple {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,578 INFO L281 TraceCheckUtils]: 17: Hoare triple {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} assume !(0bv32 == __VERIFIER_assert_~cond); {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} is VALID [2021-09-13 14:37:31,578 INFO L281 TraceCheckUtils]: 18: Hoare triple {1899#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))))} __VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(main_~k~0, main_~b~0), main_~c~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1921#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:37:31,579 INFO L281 TraceCheckUtils]: 19: Hoare triple {1921#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1855#false} is VALID [2021-09-13 14:37:31,579 INFO L281 TraceCheckUtils]: 20: Hoare triple {1855#false} assume !false; {1855#false} is VALID [2021-09-13 14:37:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:37:31,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:37:35,546 INFO L281 TraceCheckUtils]: 20: Hoare triple {1855#false} assume !false; {1855#false} is VALID [2021-09-13 14:37:35,546 INFO L281 TraceCheckUtils]: 19: Hoare triple {1931#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1855#false} is VALID [2021-09-13 14:37:35,547 INFO L281 TraceCheckUtils]: 18: Hoare triple {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(main_~k~0, main_~b~0), main_~c~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1931#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:37:35,547 INFO L281 TraceCheckUtils]: 17: Hoare triple {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:35,547 INFO L281 TraceCheckUtils]: 16: Hoare triple {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:35,548 INFO L281 TraceCheckUtils]: 15: Hoare triple {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:35,548 INFO L281 TraceCheckUtils]: 14: Hoare triple {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:35,548 INFO L281 TraceCheckUtils]: 13: Hoare triple {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 12: Hoare triple {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !false; {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 11: Hoare triple {1854#true} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1935#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 10: Hoare triple {1854#true} assume !false; {1854#true} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 9: Hoare triple {1854#true} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {1854#true} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 8: Hoare triple {1854#true} assume !(0bv32 == assume_abort_if_not_~cond); {1854#true} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 7: Hoare triple {1854#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1854#true} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 6: Hoare triple {1854#true} assume !(0bv32 == assume_abort_if_not_~cond); {1854#true} is VALID [2021-09-13 14:37:35,549 INFO L281 TraceCheckUtils]: 5: Hoare triple {1854#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1854#true} is VALID [2021-09-13 14:37:35,550 INFO L281 TraceCheckUtils]: 4: Hoare triple {1854#true} assume !(0bv32 == assume_abort_if_not_~cond); {1854#true} is VALID [2021-09-13 14:37:35,550 INFO L281 TraceCheckUtils]: 3: Hoare triple {1854#true} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1854#true} is VALID [2021-09-13 14:37:35,550 INFO L281 TraceCheckUtils]: 2: Hoare triple {1854#true} assume !(0bv32 == assume_abort_if_not_~cond); {1854#true} is VALID [2021-09-13 14:37:35,550 INFO L281 TraceCheckUtils]: 1: Hoare triple {1854#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1854#true} is VALID [2021-09-13 14:37:35,550 INFO L281 TraceCheckUtils]: 0: Hoare triple {1854#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {1854#true} is VALID [2021-09-13 14:37:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:37:35,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:37:35,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249579376] [2021-09-13 14:37:35,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249579376] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:37:35,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:37:35,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 4] imperfect sequences [] total 13 [2021-09-13 14:37:35,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825146337] [2021-09-13 14:37:35,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:37:35,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:37:35,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:35,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:37:35,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 14:37:35,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:37:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 14:37:35,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:37:35,989 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:37:55,615 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:38:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:08,798 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2021-09-13 14:38:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-13 14:38:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:38:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:38:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 69 transitions. [2021-09-13 14:38:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 69 transitions. [2021-09-13 14:38:08,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 69 transitions. [2021-09-13 14:38:09,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:09,737 INFO L225 Difference]: With dead ends: 79 [2021-09-13 14:38:09,737 INFO L226 Difference]: Without dead ends: 77 [2021-09-13 14:38:09,737 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2245.89ms TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:38:09,738 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13836.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.22ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 13841.26ms IncrementalHoareTripleChecker+Time [2021-09-13 14:38:09,738 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 306 Unknown, 0 Unchecked, 3.22ms Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 48 Unchecked, 13841.26ms Time] [2021-09-13 14:38:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-09-13 14:38:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2021-09-13 14:38:09,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:38:09,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:09,794 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:09,794 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:09,795 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2021-09-13 14:38:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-09-13 14:38:09,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:09,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:09,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2021-09-13 14:38:09,796 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2021-09-13 14:38:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:09,797 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2021-09-13 14:38:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-09-13 14:38:09,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:09,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:09,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:38:09,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:38:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2021-09-13 14:38:09,799 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 21 [2021-09-13 14:38:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:38:09,799 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2021-09-13 14:38:09,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2021-09-13 14:38:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:38:09,800 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:38:09,800 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:38:09,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-09-13 14:38:10,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:38:10,009 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:38:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:38:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 94063923, now seen corresponding path program 1 times [2021-09-13 14:38:10,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:38:10,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282539757] [2021-09-13 14:38:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:38:10,010 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:38:10,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:38:10,019 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:38:10,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-09-13 14:38:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:10,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:38:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:10,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:38:11,587 INFO L281 TraceCheckUtils]: 0: Hoare triple {2348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {2348#true} is VALID [2021-09-13 14:38:11,588 INFO L281 TraceCheckUtils]: 1: Hoare triple {2348#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2356#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:38:11,588 INFO L281 TraceCheckUtils]: 2: Hoare triple {2356#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (and (or (not (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32))) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {2360#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,589 INFO L281 TraceCheckUtils]: 3: Hoare triple {2360#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2364#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,590 INFO L281 TraceCheckUtils]: 4: Hoare triple {2364#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32))) (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,590 INFO L281 TraceCheckUtils]: 5: Hoare triple {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,590 INFO L281 TraceCheckUtils]: 6: Hoare triple {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,591 INFO L281 TraceCheckUtils]: 7: Hoare triple {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,591 INFO L281 TraceCheckUtils]: 8: Hoare triple {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,592 INFO L281 TraceCheckUtils]: 9: Hoare triple {2368#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,592 INFO L281 TraceCheckUtils]: 10: Hoare triple {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,593 INFO L281 TraceCheckUtils]: 11: Hoare triple {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,593 INFO L281 TraceCheckUtils]: 12: Hoare triple {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,593 INFO L281 TraceCheckUtils]: 13: Hoare triple {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !~bvsge64(main_~c~0, main_~b~0); {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,594 INFO L281 TraceCheckUtils]: 14: Hoare triple {2384#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,594 INFO L281 TraceCheckUtils]: 15: Hoare triple {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,595 INFO L281 TraceCheckUtils]: 16: Hoare triple {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,595 INFO L281 TraceCheckUtils]: 17: Hoare triple {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false; {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,596 INFO L281 TraceCheckUtils]: 18: Hoare triple {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} is VALID [2021-09-13 14:38:11,596 INFO L281 TraceCheckUtils]: 19: Hoare triple {2400#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv5 32)) (bvsle ULTIMATE.start_main_~x~0 (_ bv5 32)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2416#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:38:11,597 INFO L281 TraceCheckUtils]: 20: Hoare triple {2416#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {2349#false} is VALID [2021-09-13 14:38:11,597 INFO L281 TraceCheckUtils]: 21: Hoare triple {2349#false} assume !false; {2349#false} is VALID [2021-09-13 14:38:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:38:11,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:38:22,416 INFO L281 TraceCheckUtils]: 21: Hoare triple {2349#false} assume !false; {2349#false} is VALID [2021-09-13 14:38:22,417 INFO L281 TraceCheckUtils]: 20: Hoare triple {2426#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {2349#false} is VALID [2021-09-13 14:38:22,417 INFO L281 TraceCheckUtils]: 19: Hoare triple {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2426#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:38:22,418 INFO L281 TraceCheckUtils]: 18: Hoare triple {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:22,418 INFO L281 TraceCheckUtils]: 17: Hoare triple {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !false; {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:22,418 INFO L281 TraceCheckUtils]: 16: Hoare triple {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:22,423 INFO L281 TraceCheckUtils]: 15: Hoare triple {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !false; {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:22,423 INFO L281 TraceCheckUtils]: 14: Hoare triple {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {2430#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:22,423 INFO L281 TraceCheckUtils]: 13: Hoare triple {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !~bvsge64(main_~c~0, main_~b~0); {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:38:22,424 INFO L281 TraceCheckUtils]: 12: Hoare triple {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !false; {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:38:22,424 INFO L281 TraceCheckUtils]: 11: Hoare triple {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:38:22,424 INFO L281 TraceCheckUtils]: 10: Hoare triple {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !false; {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:38:22,425 INFO L281 TraceCheckUtils]: 9: Hoare triple {2348#true} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32); {2446#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:38:22,425 INFO L281 TraceCheckUtils]: 8: Hoare triple {2348#true} assume !(0bv32 == assume_abort_if_not_~cond); {2348#true} is VALID [2021-09-13 14:38:22,425 INFO L281 TraceCheckUtils]: 7: Hoare triple {2348#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2348#true} is VALID [2021-09-13 14:38:22,425 INFO L281 TraceCheckUtils]: 6: Hoare triple {2348#true} assume !(0bv32 == assume_abort_if_not_~cond); {2348#true} is VALID [2021-09-13 14:38:22,425 INFO L281 TraceCheckUtils]: 5: Hoare triple {2348#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2348#true} is VALID [2021-09-13 14:38:22,426 INFO L281 TraceCheckUtils]: 4: Hoare triple {2348#true} assume !(0bv32 == assume_abort_if_not_~cond); {2348#true} is VALID [2021-09-13 14:38:22,426 INFO L281 TraceCheckUtils]: 3: Hoare triple {2348#true} main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 0bv32) && ~bvsle32(main_~y~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2348#true} is VALID [2021-09-13 14:38:22,426 INFO L281 TraceCheckUtils]: 2: Hoare triple {2348#true} assume !(0bv32 == assume_abort_if_not_~cond); {2348#true} is VALID [2021-09-13 14:38:22,426 INFO L281 TraceCheckUtils]: 1: Hoare triple {2348#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~d~0, main_~v~0, main_~c~0, main_~k~0, main_~temp~0, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 0bv32) && ~bvsle32(main_~x~0, 5bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2348#true} is VALID [2021-09-13 14:38:22,426 INFO L281 TraceCheckUtils]: 0: Hoare triple {2348#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32); {2348#true} is VALID [2021-09-13 14:38:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:38:22,427 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:38:22,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282539757] [2021-09-13 14:38:22,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282539757] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:38:22,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:38:22,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2021-09-13 14:38:22,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860814646] [2021-09-13 14:38:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-09-13 14:38:22,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:38:22,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:23,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:23,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:38:23,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:38:23,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:38:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:38:23,135 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:38:42,493 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:38:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:38:42,527 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8777.44ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:38:42,527 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8008.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.39ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8010.78ms IncrementalHoareTripleChecker+Time [2021-09-13 14:38:42,528 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 1.39ms Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 1 Unknown, 0 Unchecked, 8010.78ms Time] [2021-09-13 14:38:42,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:38:42,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:38:42,729 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@32a16cfe at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveInternal(ChainingHoareTripleChecker.java:318) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:290) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-09-13 14:38:42,732 INFO L158 Benchmark]: Toolchain (without parser) took 215739.35ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 39.8MB in the beginning and 40.0MB in the end (delta: -176.8kB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2021-09-13 14:38:42,732 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:38:42,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.58ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 42.1MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:38:42,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.88ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 40.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:38:42,733 INFO L158 Benchmark]: Boogie Preprocessor took 24.30ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 38.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:38:42,733 INFO L158 Benchmark]: RCFGBuilder took 4331.49ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 27.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:38:42,734 INFO L158 Benchmark]: TraceAbstraction took 211126.98ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 26.5MB in the beginning and 40.0MB in the end (delta: -13.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2021-09-13 14:38:42,739 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.20ms. Allocated memory is still 60.8MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.58ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 42.1MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.88ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 40.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.30ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 38.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 4331.49ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 27.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 211126.98ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 26.5MB in the beginning and 40.0MB in the end (delta: -13.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@32a16cfe de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@32a16cfe: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 14:38:42,784 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...