./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound50.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_valuebound50.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 51f02f4bbf4fcef8f26c70f6c839d08aece336aa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_valuebound50.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 51f02f4bbf4fcef8f26c70f6c839d08aece336aa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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@7fdf402a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:26:57,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:26:57,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:26:57,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:26:57,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:26:57,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:26:57,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:26:57,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:26:57,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:26:57,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:26:57,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:26:57,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:26:57,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:26:57,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:26:57,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:26:57,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:26:57,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:26:57,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:26:57,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:26:57,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:26:57,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:26:57,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:26:57,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:26:57,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:26:57,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:26:57,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:26:57,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:26:57,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:26:57,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:26:57,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:26:57,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:26:57,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:26:57,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:26:57,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:26:57,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:26:57,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:26:57,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:26:57,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:26:57,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:26:57,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:26:57,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:26:57,748 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:57,785 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:26:57,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:26:57,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:26:57,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:26:57,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:26:57,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:26:57,789 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:26:57,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:26:57,790 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:26:57,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:26:57,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:26:57,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:26:57,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:26:57,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:26:57,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:26:57,792 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:26:57,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:26:57,792 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:26:57,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:26:57,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:26:57,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:26:57,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:26:57,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:26:57,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:26:57,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:26:57,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:26:57,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:26:57,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:26:57,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:26:57,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:26:57,795 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 -> 51f02f4bbf4fcef8f26c70f6c839d08aece336aa [2021-09-13 14:26:58,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:26:58,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:26:58,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:26:58,178 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:26:58,178 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:26:58,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound50.c [2021-09-13 14:26:58,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40e8bf63/34583240c131419c91f61f3d028190ad/FLAG8e6c3abfb [2021-09-13 14:26:58,670 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:26:58,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound50.c [2021-09-13 14:26:58,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40e8bf63/34583240c131419c91f61f3d028190ad/FLAG8e6c3abfb [2021-09-13 14:26:58,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40e8bf63/34583240c131419c91f61f3d028190ad [2021-09-13 14:26:58,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:26:58,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:26:58,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:26:58,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:26:58,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:26:58,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:26:58" (1/1) ... [2021-09-13 14:26:58,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca27648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:58, skipping insertion in model container [2021-09-13 14:26:58,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:26:58" (1/1) ... [2021-09-13 14:26:58,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:26:58,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:26:58,890 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_valuebound50.c[490,503] [2021-09-13 14:26:58,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:26:58,953 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:26:59,016 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_valuebound50.c[490,503] [2021-09-13 14:26:59,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:26:59,060 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:26:59,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:59 WrapperNode [2021-09-13 14:26:59,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:26:59,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:26:59,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:26:59,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:26:59,070 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:59" (1/1) ... [2021-09-13 14:26:59,085 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:59" (1/1) ... [2021-09-13 14:26:59,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:26:59,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:26:59,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:26:59,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:26:59,134 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:59" (1/1) ... [2021-09-13 14:26:59,134 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:59" (1/1) ... [2021-09-13 14:26:59,137 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:59" (1/1) ... [2021-09-13 14:26:59,138 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:59" (1/1) ... [2021-09-13 14:26:59,153 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:59" (1/1) ... [2021-09-13 14:26:59,156 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:59" (1/1) ... [2021-09-13 14:26:59,163 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:59" (1/1) ... [2021-09-13 14:26:59,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:26:59,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:26:59,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:26:59,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:26:59,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:59" (1/1) ... [2021-09-13 14:26:59,177 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:26:59,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:59,204 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:59,231 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:59,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:26:59,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:26:59,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:26:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:26:59,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:26:59,550 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-09-13 14:26:59,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:26:59 BoogieIcfgContainer [2021-09-13 14:26:59,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:26:59,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:26:59,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:26:59,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:26:59,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:26:58" (1/3) ... [2021-09-13 14:26:59,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b18b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:26:59, skipping insertion in model container [2021-09-13 14:26:59,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:26:59" (2/3) ... [2021-09-13 14:26:59,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b18b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:26:59, skipping insertion in model container [2021-09-13 14:26:59,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:26:59" (3/3) ... [2021-09-13 14:26:59,588 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound50.c [2021-09-13 14:26:59,592 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:26:59,593 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:26:59,657 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:26:59,662 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:59,663 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:26:59,677 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:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:26:59,681 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:59,682 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:59,682 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:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -174497841, now seen corresponding path program 1 times [2021-09-13 14:26:59,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:59,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980268693] [2021-09-13 14:26:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:59,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:59,816 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:59,817 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 <= 50 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:59,818 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:59,819 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 <= 50 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:59,819 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:59,819 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:59,819 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:59,820 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:59,820 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:59,820 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:59,820 INFO L281 TraceCheckUtils]: 10: Hoare triple {45#false} assume false; {45#false} is VALID [2021-09-13 14:26:59,821 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:59,821 INFO L281 TraceCheckUtils]: 12: Hoare triple {45#false} assume 0 == __VERIFIER_assert_~cond; {45#false} is VALID [2021-09-13 14:26:59,821 INFO L281 TraceCheckUtils]: 13: Hoare triple {45#false} assume !false; {45#false} is VALID [2021-09-13 14:26:59,822 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,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:59,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980268693] [2021-09-13 14:26:59,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980268693] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:59,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:59,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:26:59,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788921810] [2021-09-13 14:26:59,830 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:59,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:59,834 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:59,853 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:59,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:26:59,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:59,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:26:59,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:26:59,874 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:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:59,982 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2021-09-13 14:26:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:26:59,984 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:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:59,985 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:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:26:59,996 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:27:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:27:00,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:27:00,148 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:27:00,156 INFO L225 Difference]: With dead ends: 79 [2021-09-13 14:27:00,156 INFO L226 Difference]: Without dead ends: 37 [2021-09-13 14:27:00,159 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:27:00,162 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.53ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:00,163 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 39.53ms Time] [2021-09-13 14:27:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-09-13 14:27:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-09-13 14:27:00,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:00,190 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:27:00,191 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:27:00,191 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:27:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:00,194 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:27:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:27:00,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:00,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:00,195 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:27:00,196 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:27:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:00,198 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:27:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:27:00,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:00,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:00,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:00,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:00,200 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:27:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-09-13 14:27:00,202 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 14 [2021-09-13 14:27:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:00,203 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-09-13 14:27:00,203 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:27:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:27:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:27:00,204 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:00,204 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:00,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:27:00,205 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:27:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1454170515, now seen corresponding path program 1 times [2021-09-13 14:27:00,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:00,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203743976] [2021-09-13 14:27:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:00,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:00,224 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:00,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432956388] [2021-09-13 14:27:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:00,225 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:00,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:00,227 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:27:00,228 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:27:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:00,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:27:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:00,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:00,569 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:27:00,569 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 <= 50 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:27:00,570 INFO L281 TraceCheckUtils]: 2: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:27:00,570 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 <= 50 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:27:00,570 INFO L281 TraceCheckUtils]: 4: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:27:00,570 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:27:00,571 INFO L281 TraceCheckUtils]: 6: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:27:00,572 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:27:00,573 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:27:00,574 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:27:00,575 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:27:00,576 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:27:00,577 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:27:00,577 INFO L281 TraceCheckUtils]: 13: Hoare triple {264#false} assume 0 == __VERIFIER_assert_~cond; {264#false} is VALID [2021-09-13 14:27:00,577 INFO L281 TraceCheckUtils]: 14: Hoare triple {264#false} assume !false; {264#false} is VALID [2021-09-13 14:27:00,577 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:00,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:00,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:00,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203743976] [2021-09-13 14:27:00,578 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:00,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432956388] [2021-09-13 14:27:00,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432956388] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:00,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:00,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:27:00,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654915386] [2021-09-13 14:27:00,581 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:27:00,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:00,581 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:27:00,598 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:27:00,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:27:00,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:00,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:27:00,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:27:00,600 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:27:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:00,952 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-09-13 14:27:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:27:00,952 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:27:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:00,954 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:27:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2021-09-13 14:27:00,958 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:27:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2021-09-13 14:27:00,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2021-09-13 14:27:01,014 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:27:01,019 INFO L225 Difference]: With dead ends: 64 [2021-09-13 14:27:01,020 INFO L226 Difference]: Without dead ends: 60 [2021-09-13 14:27:01,021 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.95ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:27:01,023 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:01,024 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 7.03ms Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 96.35ms Time] [2021-09-13 14:27:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-09-13 14:27:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2021-09-13 14:27:01,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:01,052 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:27:01,054 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:27:01,055 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:27:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:01,062 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-09-13 14:27:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-09-13 14:27:01,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:01,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:01,064 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:27:01,064 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:27:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:01,069 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-09-13 14:27:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-09-13 14:27:01,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:01,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:01,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:01,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:01,072 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:27:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-09-13 14:27:01,075 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 15 [2021-09-13 14:27:01,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:01,076 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-09-13 14:27:01,076 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:27:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:27:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:27:01,078 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:01,078 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:27:01,100 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:27:01,285 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:27:01,285 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:27:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1580206288, now seen corresponding path program 1 times [2021-09-13 14:27:01,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:01,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127408092] [2021-09-13 14:27:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:01,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:01,307 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:01,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980493936] [2021-09-13 14:27:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:01,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:01,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:01,311 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:27:01,313 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:27:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:01,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:27:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:01,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:01,911 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:27:01,912 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 <= 50 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:27:01,912 INFO L281 TraceCheckUtils]: 2: Hoare triple {561#true} assume !(0 == assume_abort_if_not_~cond); {561#true} is VALID [2021-09-13 14:27:01,913 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 <= 50 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) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:27:01,914 INFO L281 TraceCheckUtils]: 4: Hoare triple {575#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {579#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,914 INFO L281 TraceCheckUtils]: 5: Hoare triple {579#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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 (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,915 INFO L281 TraceCheckUtils]: 6: Hoare triple {579#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} assume !(0 == assume_abort_if_not_~cond); {579#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,916 INFO L281 TraceCheckUtils]: 7: Hoare triple {579#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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))) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,916 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))) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} assume !(0 == assume_abort_if_not_~cond); {593#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,917 INFO L281 TraceCheckUtils]: 9: Hoare triple {593#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,918 INFO L281 TraceCheckUtils]: 10: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} assume !false; {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,918 INFO L281 TraceCheckUtils]: 11: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} 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) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,919 INFO L281 TraceCheckUtils]: 12: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} assume !false; {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,919 INFO L281 TraceCheckUtils]: 13: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} 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) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:01,920 INFO L281 TraceCheckUtils]: 14: Hoare triple {597#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= ULTIMATE.start_main_~y~0 50))} 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:27:01,921 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:27:01,921 INFO L281 TraceCheckUtils]: 16: Hoare triple {562#false} assume !false; {562#false} is VALID [2021-09-13 14:27:01,921 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,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:01,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:01,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127408092] [2021-09-13 14:27:01,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:01,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980493936] [2021-09-13 14:27:01,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980493936] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:01,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:01,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-09-13 14:27:01,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740094829] [2021-09-13 14:27:01,923 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:27:01,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:01,924 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:27:01,944 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:27:01,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:27:01,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:01,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:27:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:27:01,946 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:27:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:02,476 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-09-13 14:27:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:27:02,476 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:27:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:02,477 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:27:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2021-09-13 14:27:02,478 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:27:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2021-09-13 14:27:02,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2021-09-13 14:27:02,535 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:27:02,537 INFO L225 Difference]: With dead ends: 60 [2021-09-13 14:27:02,537 INFO L226 Difference]: Without dead ends: 58 [2021-09-13 14:27:02,537 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 203.04ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:27:02,538 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.44ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 123.74ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:02,539 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 4.44ms Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 123.74ms Time] [2021-09-13 14:27:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-09-13 14:27:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2021-09-13 14:27:02,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:02,581 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:27:02,581 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:27:02,582 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:27:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:02,584 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-09-13 14:27:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-09-13 14:27:02,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:02,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:02,585 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:27:02,585 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:27:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:02,587 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-09-13 14:27:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-09-13 14:27:02,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:02,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:02,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:02,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:02,588 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:27:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2021-09-13 14:27:02,590 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2021-09-13 14:27:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:02,590 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2021-09-13 14:27:02,590 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:27:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2021-09-13 14:27:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:27:02,591 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:02,591 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:27:02,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:27:02,804 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:27:02,805 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:27:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1840022701, now seen corresponding path program 1 times [2021-09-13 14:27:02,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:02,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942079606] [2021-09-13 14:27:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:02,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:02,820 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:02,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973562769] [2021-09-13 14:27:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:02,820 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:02,834 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:27:02,839 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:27:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:02,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjunts are in the unsatisfiable core [2021-09-13 14:27:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:02,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:03,787 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:27:03,789 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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {890#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< 50 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~x~0 0))) (and (<= ULTIMATE.start_main_~x~0 50) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:27:03,789 INFO L281 TraceCheckUtils]: 2: Hoare triple {890#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< 50 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~x~0 0))) (and (<= ULTIMATE.start_main_~x~0 50) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0)))} assume !(0 == assume_abort_if_not_~cond); {894#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,790 INFO L281 TraceCheckUtils]: 3: Hoare triple {894#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~x~0))} 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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {898#(and (<= ULTIMATE.start_main_~x~0 50) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0)))) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,795 INFO L281 TraceCheckUtils]: 4: Hoare triple {898#(and (<= ULTIMATE.start_main_~x~0 50) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0)))) (<= 0 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,795 INFO L281 TraceCheckUtils]: 5: Hoare triple {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~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; {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,796 INFO L281 TraceCheckUtils]: 6: Hoare triple {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,798 INFO L281 TraceCheckUtils]: 7: Hoare triple {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 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; {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,799 INFO L281 TraceCheckUtils]: 8: Hoare triple {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:03,800 INFO L281 TraceCheckUtils]: 9: Hoare triple {902#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 0 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; {918#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,801 INFO L281 TraceCheckUtils]: 10: Hoare triple {918#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {918#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,801 INFO L281 TraceCheckUtils]: 11: Hoare triple {918#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~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; {925#(and (<= ULTIMATE.start_main_~x~0 50) (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,802 INFO L281 TraceCheckUtils]: 12: Hoare triple {925#(and (<= ULTIMATE.start_main_~x~0 50) (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {925#(and (<= ULTIMATE.start_main_~x~0 50) (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:03,803 INFO L281 TraceCheckUtils]: 13: Hoare triple {925#(and (<= ULTIMATE.start_main_~x~0 50) (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 0 ULTIMATE.start_main_~x~0) (= 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; {932#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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:27:03,803 INFO L281 TraceCheckUtils]: 14: Hoare triple {932#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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; {932#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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:27:03,804 INFO L281 TraceCheckUtils]: 15: Hoare triple {932#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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); {932#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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:27:03,805 INFO L281 TraceCheckUtils]: 16: Hoare triple {932#(and (<= ULTIMATE.start_main_~x~0 50) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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; {942#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:03,805 INFO L281 TraceCheckUtils]: 17: Hoare triple {942#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {883#false} is VALID [2021-09-13 14:27:03,805 INFO L281 TraceCheckUtils]: 18: Hoare triple {883#false} assume !false; {883#false} is VALID [2021-09-13 14:27:03,806 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:03,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:03,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:03,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942079606] [2021-09-13 14:27:03,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:03,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973562769] [2021-09-13 14:27:03,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973562769] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:03,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:03,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-09-13 14:27:03,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702425052] [2021-09-13 14:27:03,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:27:03,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:03,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:27:03,825 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:27:03,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:27:03,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:27:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:27:03,827 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:27:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:04,810 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-09-13 14:27:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:27:04,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:27:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:27:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 82 transitions. [2021-09-13 14:27:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:27:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 82 transitions. [2021-09-13 14:27:04,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 82 transitions. [2021-09-13 14:27:04,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:04,895 INFO L225 Difference]: With dead ends: 75 [2021-09-13 14:27:04,895 INFO L226 Difference]: Without dead ends: 73 [2021-09-13 14:27:04,896 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 383.36ms TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:27:04,896 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 288.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.61ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 292.61ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:04,897 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 3.61ms Time], IncrementalHoareTripleChecker [11 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 292.61ms Time] [2021-09-13 14:27:04,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-09-13 14:27:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2021-09-13 14:27:04,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:04,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 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:27:04,969 INFO L74 IsIncluded]: Start isIncluded. First operand 73 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:27:04,969 INFO L87 Difference]: Start difference. First operand 73 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:27:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:04,971 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2021-09-13 14:27:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2021-09-13 14:27:04,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:04,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:04,972 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 73 states. [2021-09-13 14:27:04,972 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 73 states. [2021-09-13 14:27:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:04,974 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2021-09-13 14:27:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2021-09-13 14:27:04,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:04,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:04,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:04,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:04,975 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:27:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-09-13 14:27:04,977 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 19 [2021-09-13 14:27:04,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:04,977 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-09-13 14:27:04,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:27:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-09-13 14:27:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:27:04,978 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:04,978 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:27:05,004 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:27:05,192 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:27:05,193 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:27:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1412177226, now seen corresponding path program 1 times [2021-09-13 14:27:05,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:05,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506873833] [2021-09-13 14:27:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:05,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:05,223 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:05,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603187575] [2021-09-13 14:27:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:05,223 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:05,225 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:27:05,226 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:27:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:05,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:27:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:05,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:05,471 INFO L281 TraceCheckUtils]: 0: Hoare triple {1268#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); {1268#true} is VALID [2021-09-13 14:27:05,471 INFO L281 TraceCheckUtils]: 1: Hoare triple {1268#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1268#true} is VALID [2021-09-13 14:27:05,471 INFO L281 TraceCheckUtils]: 2: Hoare triple {1268#true} assume !(0 == assume_abort_if_not_~cond); {1268#true} is VALID [2021-09-13 14:27:05,471 INFO L281 TraceCheckUtils]: 3: Hoare triple {1268#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1268#true} is VALID [2021-09-13 14:27:05,471 INFO L281 TraceCheckUtils]: 4: Hoare triple {1268#true} assume !(0 == assume_abort_if_not_~cond); {1268#true} is VALID [2021-09-13 14:27:05,472 INFO L281 TraceCheckUtils]: 5: Hoare triple {1268#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; {1288#(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:05,473 INFO L281 TraceCheckUtils]: 6: Hoare triple {1288#(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); {1292#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:05,473 INFO L281 TraceCheckUtils]: 7: Hoare triple {1292#(<= 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; {1292#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:05,474 INFO L281 TraceCheckUtils]: 8: Hoare triple {1292#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {1292#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:05,474 INFO L281 TraceCheckUtils]: 9: Hoare triple {1292#(<= 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; {1302#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:05,474 INFO L281 TraceCheckUtils]: 10: Hoare triple {1302#(<= 1 ULTIMATE.start_main_~a~0)} assume !false; {1302#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:05,475 INFO L281 TraceCheckUtils]: 11: Hoare triple {1302#(<= 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; {1309#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:05,475 INFO L281 TraceCheckUtils]: 12: Hoare triple {1309#(<= 1 ULTIMATE.start_main_~c~0)} assume !false; {1309#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:05,475 INFO L281 TraceCheckUtils]: 13: Hoare triple {1309#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {1309#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:05,476 INFO L281 TraceCheckUtils]: 14: Hoare triple {1309#(<= 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; {1319#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:05,476 INFO L281 TraceCheckUtils]: 15: Hoare triple {1319#(<= 1 ULTIMATE.start_main_~b~0)} assume !false; {1319#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:05,477 INFO L281 TraceCheckUtils]: 16: Hoare triple {1319#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {1269#false} is VALID [2021-09-13 14:27:05,477 INFO L281 TraceCheckUtils]: 17: Hoare triple {1269#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; {1269#false} is VALID [2021-09-13 14:27:05,477 INFO L281 TraceCheckUtils]: 18: Hoare triple {1269#false} assume 0 == __VERIFIER_assert_~cond; {1269#false} is VALID [2021-09-13 14:27:05,477 INFO L281 TraceCheckUtils]: 19: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2021-09-13 14:27:05,477 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:05,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:05,648 INFO L281 TraceCheckUtils]: 19: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2021-09-13 14:27:05,649 INFO L281 TraceCheckUtils]: 18: Hoare triple {1269#false} assume 0 == __VERIFIER_assert_~cond; {1269#false} is VALID [2021-09-13 14:27:05,649 INFO L281 TraceCheckUtils]: 17: Hoare triple {1269#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; {1269#false} is VALID [2021-09-13 14:27:05,649 INFO L281 TraceCheckUtils]: 16: Hoare triple {1319#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {1269#false} is VALID [2021-09-13 14:27:05,650 INFO L281 TraceCheckUtils]: 15: Hoare triple {1319#(<= 1 ULTIMATE.start_main_~b~0)} assume !false; {1319#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:05,650 INFO L281 TraceCheckUtils]: 14: Hoare triple {1309#(<= 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; {1319#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:05,651 INFO L281 TraceCheckUtils]: 13: Hoare triple {1309#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {1309#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:05,651 INFO L281 TraceCheckUtils]: 12: Hoare triple {1309#(<= 1 ULTIMATE.start_main_~c~0)} assume !false; {1309#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:05,652 INFO L281 TraceCheckUtils]: 11: Hoare triple {1302#(<= 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; {1309#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:05,652 INFO L281 TraceCheckUtils]: 10: Hoare triple {1302#(<= 1 ULTIMATE.start_main_~a~0)} assume !false; {1302#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:05,652 INFO L281 TraceCheckUtils]: 9: Hoare triple {1292#(<= 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; {1302#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:05,653 INFO L281 TraceCheckUtils]: 8: Hoare triple {1292#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {1292#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:05,653 INFO L281 TraceCheckUtils]: 7: Hoare triple {1292#(<= 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; {1292#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:05,654 INFO L281 TraceCheckUtils]: 6: Hoare triple {1374#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {1292#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:27:05,654 INFO L281 TraceCheckUtils]: 5: Hoare triple {1268#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; {1374#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:05,655 INFO L281 TraceCheckUtils]: 4: Hoare triple {1268#true} assume !(0 == assume_abort_if_not_~cond); {1268#true} is VALID [2021-09-13 14:27:05,655 INFO L281 TraceCheckUtils]: 3: Hoare triple {1268#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1268#true} is VALID [2021-09-13 14:27:05,655 INFO L281 TraceCheckUtils]: 2: Hoare triple {1268#true} assume !(0 == assume_abort_if_not_~cond); {1268#true} is VALID [2021-09-13 14:27:05,655 INFO L281 TraceCheckUtils]: 1: Hoare triple {1268#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1268#true} is VALID [2021-09-13 14:27:05,655 INFO L281 TraceCheckUtils]: 0: Hoare triple {1268#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); {1268#true} is VALID [2021-09-13 14:27:05,656 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:05,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:05,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506873833] [2021-09-13 14:27:05,656 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:05,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603187575] [2021-09-13 14:27:05,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603187575] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:05,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:05,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-09-13 14:27:05,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113692880] [2021-09-13 14:27:05,657 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:05,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:05,658 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:05,673 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:05,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:27:05,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:05,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:27:05,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:27:05,674 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:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:06,392 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2021-09-13 14:27:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:27:06,393 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:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:06,393 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:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2021-09-13 14:27:06,403 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:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2021-09-13 14:27:06,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 123 transitions. [2021-09-13 14:27:06,502 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:06,505 INFO L225 Difference]: With dead ends: 140 [2021-09-13 14:27:06,505 INFO L226 Difference]: Without dead ends: 136 [2021-09-13 14:27:06,506 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.76ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:27:06,506 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 205.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.84ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 208.67ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:06,507 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 5.84ms Time], IncrementalHoareTripleChecker [11 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 208.67ms Time] [2021-09-13 14:27:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-09-13 14:27:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2021-09-13 14:27:06,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:06,638 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:06,638 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:06,638 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:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:06,642 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2021-09-13 14:27:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2021-09-13 14:27:06,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:06,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:06,643 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:06,643 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:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:06,647 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2021-09-13 14:27:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2021-09-13 14:27:06,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:06,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:06,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:06,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:06,649 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:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2021-09-13 14:27:06,651 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 20 [2021-09-13 14:27:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:06,651 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2021-09-13 14:27:06,651 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:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2021-09-13 14:27:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-13 14:27:06,652 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:06,652 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:06,679 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:06,877 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:06,877 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:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1264867958, now seen corresponding path program 1 times [2021-09-13 14:27:06,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:06,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609681840] [2021-09-13 14:27:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:06,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:06,889 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:06,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146679936] [2021-09-13 14:27:06,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:06,890 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:06,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:06,891 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:06,892 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:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:06,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:27:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:06,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:07,372 INFO L281 TraceCheckUtils]: 0: Hoare triple {1955#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); {1955#true} is VALID [2021-09-13 14:27:07,372 INFO L281 TraceCheckUtils]: 1: Hoare triple {1955#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1955#true} is VALID [2021-09-13 14:27:07,373 INFO L281 TraceCheckUtils]: 2: Hoare triple {1955#true} assume !(0 == assume_abort_if_not_~cond); {1955#true} is VALID [2021-09-13 14:27:07,375 INFO L281 TraceCheckUtils]: 3: Hoare triple {1955#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1969#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:27:07,375 INFO L281 TraceCheckUtils]: 4: Hoare triple {1969#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:07,376 INFO L281 TraceCheckUtils]: 5: Hoare triple {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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; {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:07,376 INFO L281 TraceCheckUtils]: 6: Hoare triple {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} assume !(0 == assume_abort_if_not_~cond); {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:07,378 INFO L281 TraceCheckUtils]: 7: Hoare triple {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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; {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:07,378 INFO L281 TraceCheckUtils]: 8: Hoare triple {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} assume !(0 == assume_abort_if_not_~cond); {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:07,378 INFO L281 TraceCheckUtils]: 9: Hoare triple {1973#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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; {1989#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:07,380 INFO L281 TraceCheckUtils]: 10: Hoare triple {1989#(<= 0 ULTIMATE.start_main_~b~0)} assume !false; {1989#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:07,380 INFO L281 TraceCheckUtils]: 11: Hoare triple {1989#(<= 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; {1996#(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:07,389 INFO L281 TraceCheckUtils]: 12: Hoare triple {1996#(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; {1996#(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:07,390 INFO L281 TraceCheckUtils]: 13: Hoare triple {1996#(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; {1996#(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:07,390 INFO L281 TraceCheckUtils]: 14: Hoare triple {1996#(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; {1996#(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:07,391 INFO L281 TraceCheckUtils]: 15: Hoare triple {1996#(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); {1996#(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:07,392 INFO L281 TraceCheckUtils]: 16: Hoare triple {1996#(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; {1996#(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:07,392 INFO L281 TraceCheckUtils]: 17: Hoare triple {1996#(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); {1996#(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:07,393 INFO L281 TraceCheckUtils]: 18: Hoare triple {1996#(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; {2018#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:07,393 INFO L281 TraceCheckUtils]: 19: Hoare triple {2018#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1956#false} is VALID [2021-09-13 14:27:07,394 INFO L281 TraceCheckUtils]: 20: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2021-09-13 14:27:07,394 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,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:07,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:07,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609681840] [2021-09-13 14:27:07,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:07,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146679936] [2021-09-13 14:27:07,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146679936] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:07,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:07,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:27:07,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108979584] [2021-09-13 14:27:07,396 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:07,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:07,396 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:07,412 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:07,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:27:07,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:27:07,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:27:07,414 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:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:07,898 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2021-09-13 14:27:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:27:07,898 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:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:07,899 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:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2021-09-13 14:27:07,900 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:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2021-09-13 14:27:07,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2021-09-13 14:27:07,973 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:07,975 INFO L225 Difference]: With dead ends: 95 [2021-09-13 14:27:07,975 INFO L226 Difference]: Without dead ends: 93 [2021-09-13 14:27:07,975 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 105.56ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:27:07,978 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.97ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.75ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:07,979 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 192 Unknown, 0 Unchecked, 1.97ms Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 122.75ms Time] [2021-09-13 14:27:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-09-13 14:27:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2021-09-13 14:27:08,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:08,186 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:08,186 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:08,187 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:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:08,189 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2021-09-13 14:27:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-09-13 14:27:08,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:08,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:08,190 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:08,190 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:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:08,193 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2021-09-13 14:27:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-09-13 14:27:08,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:08,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:08,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:08,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:08,194 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:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2021-09-13 14:27:08,196 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 21 [2021-09-13 14:27:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:08,197 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2021-09-13 14:27:08,197 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:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2021-09-13 14:27:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:27:08,197 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:08,198 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:08,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-09-13 14:27:08,416 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:08,417 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:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash 94063923, now seen corresponding path program 1 times [2021-09-13 14:27:08,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:08,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401372130] [2021-09-13 14:27:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:08,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:08,429 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:08,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935384744] [2021-09-13 14:27:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:08,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:08,431 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:08,432 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:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:08,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2021-09-13 14:27:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:08,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:09,302 INFO L281 TraceCheckUtils]: 0: Hoare triple {2457#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); {2457#true} is VALID [2021-09-13 14:27:09,302 INFO L281 TraceCheckUtils]: 1: Hoare triple {2457#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2457#true} is VALID [2021-09-13 14:27:09,302 INFO L281 TraceCheckUtils]: 2: Hoare triple {2457#true} assume !(0 == assume_abort_if_not_~cond); {2457#true} is VALID [2021-09-13 14:27:09,304 INFO L281 TraceCheckUtils]: 3: Hoare triple {2457#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2471#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:27:09,304 INFO L281 TraceCheckUtils]: 4: Hoare triple {2471#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {2475#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:09,305 INFO L281 TraceCheckUtils]: 5: Hoare triple {2475#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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; {2479#(and (<= 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))) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:09,305 INFO L281 TraceCheckUtils]: 6: Hoare triple {2479#(and (<= 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))) (<= ULTIMATE.start_main_~y~0 50))} assume !(0 == assume_abort_if_not_~cond); {2483#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,306 INFO L281 TraceCheckUtils]: 7: Hoare triple {2483#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 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; {2483#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,306 INFO L281 TraceCheckUtils]: 8: Hoare triple {2483#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {2483#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,306 INFO L281 TraceCheckUtils]: 9: Hoare triple {2483#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50) (<= 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; {2493#(and (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= 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:09,307 INFO L281 TraceCheckUtils]: 10: Hoare triple {2493#(and (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= 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; {2493#(and (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= 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:09,307 INFO L281 TraceCheckUtils]: 11: Hoare triple {2493#(and (<= 0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= 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; {2500#(and (<= 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_~y~0 50) (= 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:09,308 INFO L281 TraceCheckUtils]: 12: Hoare triple {2500#(and (<= 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_~y~0 50) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {2500#(and (<= 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_~y~0 50) (= 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:09,309 INFO L281 TraceCheckUtils]: 13: Hoare triple {2500#(and (<= 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_~y~0 50) (= 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); {2507#(and (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= 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:09,309 INFO L281 TraceCheckUtils]: 14: Hoare triple {2507#(and (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) (<= ULTIMATE.start_main_~y~0 50) (= 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; {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,310 INFO L281 TraceCheckUtils]: 15: Hoare triple {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} assume !false; {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,310 INFO L281 TraceCheckUtils]: 16: Hoare triple {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 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; {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,310 INFO L281 TraceCheckUtils]: 17: Hoare triple {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} assume !false; {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,311 INFO L281 TraceCheckUtils]: 18: Hoare triple {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 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; {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:09,311 INFO L281 TraceCheckUtils]: 19: Hoare triple {2511#(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_~r~0 1) (<= ULTIMATE.start_main_~y~0 50) (<= 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; {2527#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:09,312 INFO L281 TraceCheckUtils]: 20: Hoare triple {2527#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2458#false} is VALID [2021-09-13 14:27:09,312 INFO L281 TraceCheckUtils]: 21: Hoare triple {2458#false} assume !false; {2458#false} is VALID [2021-09-13 14:27:09,312 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,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:09,661 INFO L281 TraceCheckUtils]: 21: Hoare triple {2458#false} assume !false; {2458#false} is VALID [2021-09-13 14:27:09,662 INFO L281 TraceCheckUtils]: 20: Hoare triple {2527#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2458#false} is VALID [2021-09-13 14:27:09,662 INFO L281 TraceCheckUtils]: 19: Hoare triple {2540#(= 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; {2527#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:09,662 INFO L281 TraceCheckUtils]: 18: Hoare triple {2540#(= 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; {2540#(= 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:09,663 INFO L281 TraceCheckUtils]: 17: Hoare triple {2540#(= 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; {2540#(= 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:09,663 INFO L281 TraceCheckUtils]: 16: Hoare triple {2540#(= 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; {2540#(= 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:09,664 INFO L281 TraceCheckUtils]: 15: Hoare triple {2540#(= 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; {2540#(= 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:09,664 INFO L281 TraceCheckUtils]: 14: Hoare triple {2556#(= (+ (* 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; {2540#(= 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:09,665 INFO L281 TraceCheckUtils]: 13: Hoare triple {2560#(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); {2556#(= (+ (* 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:09,665 INFO L281 TraceCheckUtils]: 12: Hoare triple {2560#(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; {2560#(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:09,666 INFO L281 TraceCheckUtils]: 11: Hoare triple {2567#(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; {2560#(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:09,666 INFO L281 TraceCheckUtils]: 10: Hoare triple {2567#(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; {2567#(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:09,667 INFO L281 TraceCheckUtils]: 9: Hoare triple {2457#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; {2567#(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:09,667 INFO L281 TraceCheckUtils]: 8: Hoare triple {2457#true} assume !(0 == assume_abort_if_not_~cond); {2457#true} is VALID [2021-09-13 14:27:09,667 INFO L281 TraceCheckUtils]: 7: Hoare triple {2457#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; {2457#true} is VALID [2021-09-13 14:27:09,667 INFO L281 TraceCheckUtils]: 6: Hoare triple {2457#true} assume !(0 == assume_abort_if_not_~cond); {2457#true} is VALID [2021-09-13 14:27:09,668 INFO L281 TraceCheckUtils]: 5: Hoare triple {2457#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; {2457#true} is VALID [2021-09-13 14:27:09,668 INFO L281 TraceCheckUtils]: 4: Hoare triple {2457#true} assume !(0 == assume_abort_if_not_~cond); {2457#true} is VALID [2021-09-13 14:27:09,668 INFO L281 TraceCheckUtils]: 3: Hoare triple {2457#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2457#true} is VALID [2021-09-13 14:27:09,668 INFO L281 TraceCheckUtils]: 2: Hoare triple {2457#true} assume !(0 == assume_abort_if_not_~cond); {2457#true} is VALID [2021-09-13 14:27:09,668 INFO L281 TraceCheckUtils]: 1: Hoare triple {2457#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2457#true} is VALID [2021-09-13 14:27:09,669 INFO L281 TraceCheckUtils]: 0: Hoare triple {2457#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); {2457#true} is VALID [2021-09-13 14:27:09,669 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,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:09,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401372130] [2021-09-13 14:27:09,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:09,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935384744] [2021-09-13 14:27:09,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935384744] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:09,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:09,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2021-09-13 14:27:09,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033654584] [2021-09-13 14:27:09,671 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:09,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:09,671 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:09,703 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:09,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-13 14:27:09,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-13 14:27:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:27:09,704 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:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:13,048 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2021-09-13 14:27:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-09-13 14:27:13,049 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:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:13,049 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:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2021-09-13 14:27:13,051 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:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2021-09-13 14:27:13,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 130 transitions. [2021-09-13 14:27:13,166 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:13,168 INFO L225 Difference]: With dead ends: 144 [2021-09-13 14:27:13,169 INFO L226 Difference]: Without dead ends: 142 [2021-09-13 14:27:13,169 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 977.03ms TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2021-09-13 14:27:13,170 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1321.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.45ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1327.46ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:13,170 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 468 Unknown, 0 Unchecked, 5.45ms Time], IncrementalHoareTripleChecker [46 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1327.46ms Time] [2021-09-13 14:27:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-09-13 14:27:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2021-09-13 14:27:13,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:13,446 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:13,446 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:13,447 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:13,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:13,452 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2021-09-13 14:27:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2021-09-13 14:27:13,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:13,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:13,454 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:13,454 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:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:13,461 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2021-09-13 14:27:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2021-09-13 14:27:13,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:13,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:13,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:13,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:13,462 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:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 146 transitions. [2021-09-13 14:27:13,466 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 146 transitions. Word has length 22 [2021-09-13 14:27:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:13,466 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 146 transitions. [2021-09-13 14:27:13,466 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:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 146 transitions. [2021-09-13 14:27:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:27:13,467 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:13,467 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:13,489 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:13,685 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:13,686 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:13,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:13,686 INFO L82 PathProgramCache]: Analyzing trace with hash 62520889, now seen corresponding path program 1 times [2021-09-13 14:27:13,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:13,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145987586] [2021-09-13 14:27:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:13,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:13,700 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:13,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1367253705] [2021-09-13 14:27:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:13,700 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:13,702 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:13,706 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:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:13,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:27:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:13,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:13,941 INFO L281 TraceCheckUtils]: 0: Hoare triple {3260#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); {3260#true} is VALID [2021-09-13 14:27:13,941 INFO L281 TraceCheckUtils]: 1: Hoare triple {3260#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3260#true} is VALID [2021-09-13 14:27:13,941 INFO L281 TraceCheckUtils]: 2: Hoare triple {3260#true} assume !(0 == assume_abort_if_not_~cond); {3260#true} is VALID [2021-09-13 14:27:13,942 INFO L281 TraceCheckUtils]: 3: Hoare triple {3260#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3260#true} is VALID [2021-09-13 14:27:13,942 INFO L281 TraceCheckUtils]: 4: Hoare triple {3260#true} assume !(0 == assume_abort_if_not_~cond); {3260#true} is VALID [2021-09-13 14:27:13,942 INFO L281 TraceCheckUtils]: 5: Hoare triple {3260#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; {3260#true} is VALID [2021-09-13 14:27:13,942 INFO L281 TraceCheckUtils]: 6: Hoare triple {3260#true} assume !(0 == assume_abort_if_not_~cond); {3260#true} is VALID [2021-09-13 14:27:13,942 INFO L281 TraceCheckUtils]: 7: Hoare triple {3260#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; {3260#true} is VALID [2021-09-13 14:27:13,942 INFO L281 TraceCheckUtils]: 8: Hoare triple {3260#true} assume !(0 == assume_abort_if_not_~cond); {3260#true} is VALID [2021-09-13 14:27:13,943 INFO L281 TraceCheckUtils]: 9: Hoare triple {3260#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; {3260#true} is VALID [2021-09-13 14:27:13,943 INFO L281 TraceCheckUtils]: 10: Hoare triple {3260#true} assume !false; {3260#true} is VALID [2021-09-13 14:27:13,943 INFO L281 TraceCheckUtils]: 11: Hoare triple {3260#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {3260#true} is VALID [2021-09-13 14:27:13,943 INFO L281 TraceCheckUtils]: 12: Hoare triple {3260#true} assume !false; {3260#true} is VALID [2021-09-13 14:27:13,944 INFO L281 TraceCheckUtils]: 13: Hoare triple {3260#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; {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:13,944 INFO L281 TraceCheckUtils]: 14: Hoare triple {3304#(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; {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:13,945 INFO L281 TraceCheckUtils]: 15: Hoare triple {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:13,945 INFO L281 TraceCheckUtils]: 16: Hoare triple {3304#(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; {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:13,946 INFO L281 TraceCheckUtils]: 17: Hoare triple {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:13,947 INFO L281 TraceCheckUtils]: 18: Hoare triple {3304#(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; {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:13,947 INFO L281 TraceCheckUtils]: 19: Hoare triple {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {3304#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:13,953 INFO L281 TraceCheckUtils]: 20: Hoare triple {3304#(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; {3326#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:13,954 INFO L281 TraceCheckUtils]: 21: Hoare triple {3326#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {3261#false} is VALID [2021-09-13 14:27:13,955 INFO L281 TraceCheckUtils]: 22: Hoare triple {3261#false} assume !false; {3261#false} is VALID [2021-09-13 14:27:13,956 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:13,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:13,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:13,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145987586] [2021-09-13 14:27:13,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:13,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367253705] [2021-09-13 14:27:13,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367253705] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:13,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:13,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:27:13,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382002924] [2021-09-13 14:27:13,958 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:13,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:13,960 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:13,979 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:13,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:27:13,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:27:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:27:13,981 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:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:14,796 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2021-09-13 14:27:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:27:14,796 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:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:14,796 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:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2021-09-13 14:27:14,797 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:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2021-09-13 14:27:14,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2021-09-13 14:27:14,846 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:14,850 INFO L225 Difference]: With dead ends: 226 [2021-09-13 14:27:14,851 INFO L226 Difference]: Without dead ends: 224 [2021-09-13 14:27:14,851 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:27:14,852 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.13ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.60ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:14,852 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 134 Unknown, 0 Unchecked, 1.13ms Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 87.60ms Time] [2021-09-13 14:27:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-09-13 14:27:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 164. [2021-09-13 14:27:15,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:15,365 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:15,366 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:15,368 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:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:15,379 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2021-09-13 14:27:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2021-09-13 14:27:15,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:15,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:15,382 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:15,383 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:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:15,389 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2021-09-13 14:27:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2021-09-13 14:27:15,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:15,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:15,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:15,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:15,391 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:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 205 transitions. [2021-09-13 14:27:15,395 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 205 transitions. Word has length 23 [2021-09-13 14:27:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:15,395 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 205 transitions. [2021-09-13 14:27:15,396 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:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 205 transitions. [2021-09-13 14:27:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 14:27:15,397 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:15,398 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:15,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-09-13 14:27:15,605 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:15,606 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:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash 201274102, now seen corresponding path program 1 times [2021-09-13 14:27:15,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:15,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854213648] [2021-09-13 14:27:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:15,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:15,628 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:15,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288181587] [2021-09-13 14:27:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:15,630 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:15,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:15,631 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:15,633 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:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:15,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2021-09-13 14:27:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:15,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 0: Hoare triple {4341#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); {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 1: Hoare triple {4341#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 2: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 3: Hoare triple {4341#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 4: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 5: Hoare triple {4341#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; {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 6: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 7: Hoare triple {4341#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; {4341#true} is VALID [2021-09-13 14:27:16,044 INFO L281 TraceCheckUtils]: 8: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:16,045 INFO L281 TraceCheckUtils]: 9: Hoare triple {4341#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; {4373#(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:16,045 INFO L281 TraceCheckUtils]: 10: Hoare triple {4373#(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; {4373#(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:16,049 INFO L281 TraceCheckUtils]: 11: Hoare triple {4373#(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; {4380#(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:16,050 INFO L281 TraceCheckUtils]: 12: Hoare triple {4380#(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; {4380#(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:16,050 INFO L281 TraceCheckUtils]: 13: Hoare triple {4380#(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); {4380#(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:16,051 INFO L281 TraceCheckUtils]: 14: Hoare triple {4380#(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; {4390#(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:16,051 INFO L281 TraceCheckUtils]: 15: Hoare triple {4390#(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; {4390#(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:16,052 INFO L281 TraceCheckUtils]: 16: Hoare triple {4390#(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; {4390#(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:16,052 INFO L281 TraceCheckUtils]: 17: Hoare triple {4390#(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; {4390#(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:16,052 INFO L281 TraceCheckUtils]: 18: Hoare triple {4390#(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; {4390#(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:16,053 INFO L281 TraceCheckUtils]: 19: Hoare triple {4390#(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; {4390#(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:16,053 INFO L281 TraceCheckUtils]: 20: Hoare triple {4390#(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); {4390#(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:16,054 INFO L281 TraceCheckUtils]: 21: Hoare triple {4390#(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; {4412#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:16,054 INFO L281 TraceCheckUtils]: 22: Hoare triple {4412#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {4342#false} is VALID [2021-09-13 14:27:16,054 INFO L281 TraceCheckUtils]: 23: Hoare triple {4342#false} assume !false; {4342#false} is VALID [2021-09-13 14:27:16,054 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:16,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:16,342 INFO L281 TraceCheckUtils]: 23: Hoare triple {4342#false} assume !false; {4342#false} is VALID [2021-09-13 14:27:16,343 INFO L281 TraceCheckUtils]: 22: Hoare triple {4412#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {4342#false} is VALID [2021-09-13 14:27:16,343 INFO L281 TraceCheckUtils]: 21: Hoare triple {4425#(= (+ (* 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; {4412#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:16,343 INFO L281 TraceCheckUtils]: 20: Hoare triple {4425#(= (+ (* 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); {4425#(= (+ (* 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:16,344 INFO L281 TraceCheckUtils]: 19: Hoare triple {4425#(= (+ (* 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; {4425#(= (+ (* 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:16,344 INFO L281 TraceCheckUtils]: 18: Hoare triple {4425#(= (+ (* 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; {4425#(= (+ (* 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:16,344 INFO L281 TraceCheckUtils]: 17: Hoare triple {4425#(= (+ (* 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; {4425#(= (+ (* 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:16,345 INFO L281 TraceCheckUtils]: 16: Hoare triple {4425#(= (+ (* 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; {4425#(= (+ (* 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:16,345 INFO L281 TraceCheckUtils]: 15: Hoare triple {4425#(= (+ (* 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; {4425#(= (+ (* 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:17,563 INFO L281 TraceCheckUtils]: 14: Hoare triple {4447#(= (+ 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; {4425#(= (+ (* 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:17,564 INFO L281 TraceCheckUtils]: 13: Hoare triple {4447#(= (+ 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); {4447#(= (+ 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:27:17,565 INFO L281 TraceCheckUtils]: 12: Hoare triple {4447#(= (+ 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; {4447#(= (+ 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:27:17,565 INFO L281 TraceCheckUtils]: 11: Hoare triple {4457#(= 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; {4447#(= (+ 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:27:17,566 INFO L281 TraceCheckUtils]: 10: Hoare triple {4457#(= 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; {4457#(= 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:17,566 INFO L281 TraceCheckUtils]: 9: Hoare triple {4341#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; {4457#(= 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:17,566 INFO L281 TraceCheckUtils]: 8: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:17,566 INFO L281 TraceCheckUtils]: 7: Hoare triple {4341#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; {4341#true} is VALID [2021-09-13 14:27:17,566 INFO L281 TraceCheckUtils]: 6: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:17,566 INFO L281 TraceCheckUtils]: 5: Hoare triple {4341#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; {4341#true} is VALID [2021-09-13 14:27:17,567 INFO L281 TraceCheckUtils]: 4: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:17,567 INFO L281 TraceCheckUtils]: 3: Hoare triple {4341#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4341#true} is VALID [2021-09-13 14:27:17,567 INFO L281 TraceCheckUtils]: 2: Hoare triple {4341#true} assume !(0 == assume_abort_if_not_~cond); {4341#true} is VALID [2021-09-13 14:27:17,567 INFO L281 TraceCheckUtils]: 1: Hoare triple {4341#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4341#true} is VALID [2021-09-13 14:27:17,567 INFO L281 TraceCheckUtils]: 0: Hoare triple {4341#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); {4341#true} is VALID [2021-09-13 14:27:17,567 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:17,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:17,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854213648] [2021-09-13 14:27:17,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:17,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288181587] [2021-09-13 14:27:17,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288181587] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:17,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:17,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:27:17,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036288337] [2021-09-13 14:27:17,569 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:27:17,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:17,569 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:27:17,693 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:27:17,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:27:17,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:27:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:27:17,694 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:27:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:20,434 INFO L93 Difference]: Finished difference Result 440 states and 548 transitions. [2021-09-13 14:27:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:27:20,435 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:27:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:20,435 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:27:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 242 transitions. [2021-09-13 14:27:20,438 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:27:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 242 transitions. [2021-09-13 14:27:20,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 242 transitions. [2021-09-13 14:27:21,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:21,305 INFO L225 Difference]: With dead ends: 440 [2021-09-13 14:27:21,305 INFO L226 Difference]: Without dead ends: 434 [2021-09-13 14:27:21,306 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 351.62ms TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-09-13 14:27:21,306 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 640.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.52ms SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 645.40ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:21,307 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 492 Unknown, 0 Unchecked, 5.52ms Time], IncrementalHoareTripleChecker [81 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 645.40ms Time] [2021-09-13 14:27:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-09-13 14:27:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 261. [2021-09-13 14:27:22,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:22,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 261 states, 256 states have (on average 1.28515625) internal successors, (329), 260 states have internal predecessors, (329), 0 states have call successors, (0), 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:22,213 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 261 states, 256 states have (on average 1.28515625) internal successors, (329), 260 states have internal predecessors, (329), 0 states have call successors, (0), 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:22,213 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 261 states, 256 states have (on average 1.28515625) internal successors, (329), 260 states have internal predecessors, (329), 0 states have call successors, (0), 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:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:22,225 INFO L93 Difference]: Finished difference Result 434 states and 517 transitions. [2021-09-13 14:27:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 517 transitions. [2021-09-13 14:27:22,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:22,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:22,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.28515625) internal successors, (329), 260 states have internal predecessors, (329), 0 states have call successors, (0), 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 434 states. [2021-09-13 14:27:22,227 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.28515625) internal successors, (329), 260 states have internal predecessors, (329), 0 states have call successors, (0), 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 434 states. [2021-09-13 14:27:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:22,245 INFO L93 Difference]: Finished difference Result 434 states and 517 transitions. [2021-09-13 14:27:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 517 transitions. [2021-09-13 14:27:22,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:22,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:22,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:22,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.28515625) internal successors, (329), 260 states have internal predecessors, (329), 0 states have call successors, (0), 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:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 329 transitions. [2021-09-13 14:27:22,254 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 329 transitions. Word has length 24 [2021-09-13 14:27:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:22,254 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 329 transitions. [2021-09-13 14:27:22,254 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:27:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 329 transitions. [2021-09-13 14:27:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:27:22,258 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:22,258 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:27:22,283 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:27:22,471 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:27:22,471 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1112899551, now seen corresponding path program 1 times [2021-09-13 14:27:22,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:22,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472822029] [2021-09-13 14:27:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:22,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:22,481 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:22,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358167775] [2021-09-13 14:27:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:22,481 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:22,487 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:27:22,493 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:27:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:22,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2021-09-13 14:27:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:22,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:23,643 INFO L281 TraceCheckUtils]: 0: Hoare triple {6383#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); {6383#true} is VALID [2021-09-13 14:27:23,643 INFO L281 TraceCheckUtils]: 1: Hoare triple {6383#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6383#true} is VALID [2021-09-13 14:27:23,644 INFO L281 TraceCheckUtils]: 2: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:23,644 INFO L281 TraceCheckUtils]: 3: Hoare triple {6383#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6383#true} is VALID [2021-09-13 14:27:23,644 INFO L281 TraceCheckUtils]: 4: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:23,644 INFO L281 TraceCheckUtils]: 5: Hoare triple {6383#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; {6383#true} is VALID [2021-09-13 14:27:23,644 INFO L281 TraceCheckUtils]: 6: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:23,644 INFO L281 TraceCheckUtils]: 7: Hoare triple {6383#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; {6383#true} is VALID [2021-09-13 14:27:23,645 INFO L281 TraceCheckUtils]: 8: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:23,646 INFO L281 TraceCheckUtils]: 9: Hoare triple {6383#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; {6415#(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:27:23,646 INFO L281 TraceCheckUtils]: 10: Hoare triple {6415#(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; {6415#(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:27:23,647 INFO L281 TraceCheckUtils]: 11: Hoare triple {6415#(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; {6422#(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:27:23,647 INFO L281 TraceCheckUtils]: 12: Hoare triple {6422#(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; {6422#(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:27:23,648 INFO L281 TraceCheckUtils]: 13: Hoare triple {6422#(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);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,651 INFO L281 TraceCheckUtils]: 14: Hoare triple {6429#(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) (= 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; {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,652 INFO L281 TraceCheckUtils]: 15: Hoare triple {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,653 INFO L281 TraceCheckUtils]: 16: Hoare triple {6429#(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) (= 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; {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,657 INFO L281 TraceCheckUtils]: 17: Hoare triple {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,666 INFO L281 TraceCheckUtils]: 18: Hoare triple {6429#(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) (= 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; {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,667 INFO L281 TraceCheckUtils]: 19: Hoare triple {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,667 INFO L281 TraceCheckUtils]: 20: Hoare triple {6429#(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) (= 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; {6451#(and (= 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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,668 INFO L281 TraceCheckUtils]: 21: Hoare triple {6451#(and (= 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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,668 INFO L281 TraceCheckUtils]: 22: Hoare triple {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= 2 * main_~v~0); {6429#(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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,669 INFO L281 TraceCheckUtils]: 23: Hoare triple {6429#(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) (= 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; {6461#(and (= 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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,669 INFO L281 TraceCheckUtils]: 24: Hoare triple {6461#(and (= 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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false; {6461#(and (= 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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,670 INFO L281 TraceCheckUtils]: 25: Hoare triple {6461#(and (= 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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {6461#(and (= 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) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:23,670 INFO L281 TraceCheckUtils]: 26: Hoare triple {6461#(and (= 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) (= 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; {6471#(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_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:27:23,671 INFO L281 TraceCheckUtils]: 27: Hoare triple {6471#(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_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} assume !false; {6471#(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_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:27:23,672 INFO L281 TraceCheckUtils]: 28: Hoare triple {6471#(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_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} assume !(0 != main_~b~0); {6478#(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_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:27:23,673 INFO L281 TraceCheckUtils]: 29: Hoare triple {6478#(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_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~y~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; {6482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:23,673 INFO L281 TraceCheckUtils]: 30: Hoare triple {6482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {6384#false} is VALID [2021-09-13 14:27:23,673 INFO L281 TraceCheckUtils]: 31: Hoare triple {6384#false} assume !false; {6384#false} is VALID [2021-09-13 14:27:23,673 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:23,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:24,616 INFO L281 TraceCheckUtils]: 31: Hoare triple {6384#false} assume !false; {6384#false} is VALID [2021-09-13 14:27:24,616 INFO L281 TraceCheckUtils]: 30: Hoare triple {6482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {6384#false} is VALID [2021-09-13 14:27:24,617 INFO L281 TraceCheckUtils]: 29: Hoare triple {6495#(= (+ (* 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; {6482#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:24,617 INFO L281 TraceCheckUtils]: 28: Hoare triple {6499#(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); {6495#(= (+ (* 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:27:24,618 INFO L281 TraceCheckUtils]: 27: Hoare triple {6499#(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; {6499#(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:27:25,100 INFO L281 TraceCheckUtils]: 26: Hoare triple {6506#(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; {6499#(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:27:25,101 INFO L281 TraceCheckUtils]: 25: Hoare triple {6506#(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); {6506#(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:27:25,101 INFO L281 TraceCheckUtils]: 24: Hoare triple {6506#(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; {6506#(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:27:25,149 INFO L281 TraceCheckUtils]: 23: Hoare triple {6516#(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; {6506#(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:27:25,149 INFO L281 TraceCheckUtils]: 22: Hoare triple {6516#(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); {6516#(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:27:25,150 INFO L281 TraceCheckUtils]: 21: Hoare triple {6523#(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); {6516#(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:27:25,151 INFO L281 TraceCheckUtils]: 20: Hoare triple {6527#(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; {6523#(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:27:25,151 INFO L281 TraceCheckUtils]: 19: Hoare triple {6527#(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); {6527#(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:27:25,151 INFO L281 TraceCheckUtils]: 18: Hoare triple {6527#(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; {6527#(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:27:25,152 INFO L281 TraceCheckUtils]: 17: Hoare triple {6527#(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); {6527#(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:27:25,152 INFO L281 TraceCheckUtils]: 16: Hoare triple {6527#(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_~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; {6527#(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:27:25,152 INFO L281 TraceCheckUtils]: 15: Hoare triple {6527#(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); {6527#(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:27:25,153 INFO L281 TraceCheckUtils]: 14: Hoare triple {6527#(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 !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; {6527#(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:27:25,153 INFO L281 TraceCheckUtils]: 13: Hoare triple {6549#(or (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* 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_~s~0 ULTIMATE.start_main_~y~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);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {6527#(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:27:25,153 INFO L281 TraceCheckUtils]: 12: Hoare triple {6549#(or (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* 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_~s~0 ULTIMATE.start_main_~y~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; {6549#(or (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* 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_~s~0 ULTIMATE.start_main_~y~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:27:25,154 INFO L281 TraceCheckUtils]: 11: Hoare triple {6556#(or (= (+ (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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_~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; {6549#(or (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* 2 (* 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_~s~0 ULTIMATE.start_main_~y~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:27:25,154 INFO L281 TraceCheckUtils]: 10: Hoare triple {6556#(or (= (+ (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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_~b~0 ULTIMATE.start_main_~a~0)))} assume !false; {6556#(or (= (+ (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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_~b~0 ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:27:25,155 INFO L281 TraceCheckUtils]: 9: Hoare triple {6383#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; {6556#(or (= (+ (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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_~b~0 ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:27:25,155 INFO L281 TraceCheckUtils]: 8: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:25,155 INFO L281 TraceCheckUtils]: 7: Hoare triple {6383#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; {6383#true} is VALID [2021-09-13 14:27:25,155 INFO L281 TraceCheckUtils]: 6: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:25,156 INFO L281 TraceCheckUtils]: 5: Hoare triple {6383#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; {6383#true} is VALID [2021-09-13 14:27:25,156 INFO L281 TraceCheckUtils]: 4: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:25,156 INFO L281 TraceCheckUtils]: 3: Hoare triple {6383#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6383#true} is VALID [2021-09-13 14:27:25,156 INFO L281 TraceCheckUtils]: 2: Hoare triple {6383#true} assume !(0 == assume_abort_if_not_~cond); {6383#true} is VALID [2021-09-13 14:27:25,156 INFO L281 TraceCheckUtils]: 1: Hoare triple {6383#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6383#true} is VALID [2021-09-13 14:27:25,156 INFO L281 TraceCheckUtils]: 0: Hoare triple {6383#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); {6383#true} is VALID [2021-09-13 14:27:25,156 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:25,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:25,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472822029] [2021-09-13 14:27:25,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:25,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358167775] [2021-09-13 14:27:25,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358167775] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:25,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:25,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-09-13 14:27:25,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204234935] [2021-09-13 14:27:25,157 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:27:25,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:25,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:27:25,345 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:27:25,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-09-13 14:27:25,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-09-13 14:27:25,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:27:25,346 INFO L87 Difference]: Start difference. First operand 261 states and 329 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:27:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:37,699 INFO L93 Difference]: Finished difference Result 746 states and 914 transitions. [2021-09-13 14:27:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-09-13 14:27:37,699 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:27:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:27:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 345 transitions. [2021-09-13 14:27:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:27:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 345 transitions. [2021-09-13 14:27:37,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 345 transitions. [2021-09-13 14:27:40,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:40,221 INFO L225 Difference]: With dead ends: 746 [2021-09-13 14:27:40,222 INFO L226 Difference]: Without dead ends: 733 [2021-09-13 14:27:40,223 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 2826.94ms TimeCoverageRelationStatistics Valid=898, Invalid=3932, Unknown=0, NotChecked=0, Total=4830 [2021-09-13 14:27:40,224 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 470 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3785.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.53ms SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3800.65ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:40,225 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 0 Invalid, 1188 Unknown, 0 Unchecked, 11.53ms Time], IncrementalHoareTripleChecker [168 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 3800.65ms Time] [2021-09-13 14:27:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-09-13 14:27:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 396. [2021-09-13 14:27:41,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:41,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 733 states. Second operand has 396 states, 391 states have (on average 1.2710997442455243) internal successors, (497), 395 states have internal predecessors, (497), 0 states have call successors, (0), 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:41,874 INFO L74 IsIncluded]: Start isIncluded. First operand 733 states. Second operand has 396 states, 391 states have (on average 1.2710997442455243) internal successors, (497), 395 states have internal predecessors, (497), 0 states have call successors, (0), 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:41,875 INFO L87 Difference]: Start difference. First operand 733 states. Second operand has 396 states, 391 states have (on average 1.2710997442455243) internal successors, (497), 395 states have internal predecessors, (497), 0 states have call successors, (0), 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:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:41,899 INFO L93 Difference]: Finished difference Result 733 states and 889 transitions. [2021-09-13 14:27:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 889 transitions. [2021-09-13 14:27:41,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:41,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:41,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 391 states have (on average 1.2710997442455243) internal successors, (497), 395 states have internal predecessors, (497), 0 states have call successors, (0), 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 733 states. [2021-09-13 14:27:41,902 INFO L87 Difference]: Start difference. First operand has 396 states, 391 states have (on average 1.2710997442455243) internal successors, (497), 395 states have internal predecessors, (497), 0 states have call successors, (0), 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 733 states. [2021-09-13 14:27:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:41,928 INFO L93 Difference]: Finished difference Result 733 states and 889 transitions. [2021-09-13 14:27:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 889 transitions. [2021-09-13 14:27:41,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:41,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:41,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:41,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.2710997442455243) internal successors, (497), 395 states have internal predecessors, (497), 0 states have call successors, (0), 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:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 497 transitions. [2021-09-13 14:27:41,947 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 497 transitions. Word has length 32 [2021-09-13 14:27:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:41,948 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 497 transitions. [2021-09-13 14:27:41,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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:27:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 497 transitions. [2021-09-13 14:27:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:27:41,949 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:41,949 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:27:41,974 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:27:42,164 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:27:42,165 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash -986732336, now seen corresponding path program 1 times [2021-09-13 14:27:42,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:42,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779064794] [2021-09-13 14:27:42,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:42,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:42,175 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:42,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033021725] [2021-09-13 14:27:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:42,176 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:42,177 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:27:42,183 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:27:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:42,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2021-09-13 14:27:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:42,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:42,871 INFO L281 TraceCheckUtils]: 0: Hoare triple {9791#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); {9791#true} is VALID [2021-09-13 14:27:42,872 INFO L281 TraceCheckUtils]: 1: Hoare triple {9791#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9791#true} is VALID [2021-09-13 14:27:42,872 INFO L281 TraceCheckUtils]: 2: Hoare triple {9791#true} assume !(0 == assume_abort_if_not_~cond); {9791#true} is VALID [2021-09-13 14:27:42,873 INFO L281 TraceCheckUtils]: 3: Hoare triple {9791#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9805#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:27:42,873 INFO L281 TraceCheckUtils]: 4: Hoare triple {9805#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< ULTIMATE.start_main_~y~0 0) (< 50 ULTIMATE.start_main_~y~0))))} assume !(0 == assume_abort_if_not_~cond); {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:42,874 INFO L281 TraceCheckUtils]: 5: Hoare triple {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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; {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:42,874 INFO L281 TraceCheckUtils]: 6: Hoare triple {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} assume !(0 == assume_abort_if_not_~cond); {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:42,874 INFO L281 TraceCheckUtils]: 7: Hoare triple {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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; {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:42,875 INFO L281 TraceCheckUtils]: 8: Hoare triple {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} assume !(0 == assume_abort_if_not_~cond); {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} is VALID [2021-09-13 14:27:42,875 INFO L281 TraceCheckUtils]: 9: Hoare triple {9809#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 50))} 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; {9825#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:42,875 INFO L281 TraceCheckUtils]: 10: Hoare triple {9825#(<= 0 ULTIMATE.start_main_~b~0)} assume !false; {9825#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:42,876 INFO L281 TraceCheckUtils]: 11: Hoare triple {9825#(<= 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; {9832#(and (<= 0 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:42,876 INFO L281 TraceCheckUtils]: 12: Hoare triple {9832#(and (<= 0 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !false; {9832#(and (<= 0 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:27:42,877 INFO L281 TraceCheckUtils]: 13: Hoare triple {9832#(and (<= 0 ULTIMATE.start_main_~b~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; {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,877 INFO L281 TraceCheckUtils]: 14: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 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; {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,877 INFO L281 TraceCheckUtils]: 15: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,878 INFO L281 TraceCheckUtils]: 16: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 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; {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,878 INFO L281 TraceCheckUtils]: 17: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,879 INFO L281 TraceCheckUtils]: 18: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 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; {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,879 INFO L281 TraceCheckUtils]: 19: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,880 INFO L281 TraceCheckUtils]: 20: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 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; {9861#(and (<= 0 ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,880 INFO L281 TraceCheckUtils]: 21: Hoare triple {9861#(and (<= 0 ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:27:42,880 INFO L281 TraceCheckUtils]: 22: Hoare triple {9839#(and (<= 0 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (not (= ULTIMATE.start_main_~b~0 0)) (= ULTIMATE.start_main_~d~0 1))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {9868#(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)))} is VALID [2021-09-13 14:27:42,881 INFO L281 TraceCheckUtils]: 23: Hoare triple {9868#(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)))} 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; {9868#(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)))} is VALID [2021-09-13 14:27:42,881 INFO L281 TraceCheckUtils]: 24: Hoare triple {9868#(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)))} assume !(0 == __VERIFIER_assert_~cond); {9868#(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)))} is VALID [2021-09-13 14:27:42,882 INFO L281 TraceCheckUtils]: 25: Hoare triple {9868#(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)))} __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; {9868#(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)))} is VALID [2021-09-13 14:27:42,882 INFO L281 TraceCheckUtils]: 26: Hoare triple {9868#(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)))} assume !(0 == __VERIFIER_assert_~cond); {9868#(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)))} is VALID [2021-09-13 14:27:42,883 INFO L281 TraceCheckUtils]: 27: Hoare triple {9868#(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)))} __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; {9868#(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)))} is VALID [2021-09-13 14:27:42,883 INFO L281 TraceCheckUtils]: 28: Hoare triple {9868#(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)))} assume !(0 == __VERIFIER_assert_~cond); {9868#(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)))} is VALID [2021-09-13 14:27:42,883 INFO L281 TraceCheckUtils]: 29: Hoare triple {9868#(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)))} __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; {9890#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:42,884 INFO L281 TraceCheckUtils]: 30: Hoare triple {9890#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {9792#false} is VALID [2021-09-13 14:27:42,884 INFO L281 TraceCheckUtils]: 31: Hoare triple {9792#false} assume !false; {9792#false} is VALID [2021-09-13 14:27:42,884 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:27:42,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:43,084 INFO L281 TraceCheckUtils]: 31: Hoare triple {9792#false} assume !false; {9792#false} is VALID [2021-09-13 14:27:43,085 INFO L281 TraceCheckUtils]: 30: Hoare triple {9890#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {9792#false} is VALID [2021-09-13 14:27:43,085 INFO L281 TraceCheckUtils]: 29: Hoare triple {9903#(= (* 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; {9890#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:43,086 INFO L281 TraceCheckUtils]: 28: Hoare triple {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,086 INFO L281 TraceCheckUtils]: 27: Hoare triple {9903#(= (* 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; {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,086 INFO L281 TraceCheckUtils]: 26: Hoare triple {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,087 INFO L281 TraceCheckUtils]: 25: Hoare triple {9903#(= (* 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; {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,087 INFO L281 TraceCheckUtils]: 24: Hoare triple {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,087 INFO L281 TraceCheckUtils]: 23: Hoare triple {9903#(= (* 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; {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,089 INFO L281 TraceCheckUtils]: 22: Hoare triple {9903#(= (* 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; {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,090 INFO L281 TraceCheckUtils]: 21: Hoare triple {9928#(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); {9903#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:27:43,090 INFO L281 TraceCheckUtils]: 20: Hoare triple {9791#true} __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; {9928#(or (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:27:43,090 INFO L281 TraceCheckUtils]: 19: Hoare triple {9791#true} assume !(0 == __VERIFIER_assert_~cond); {9791#true} is VALID [2021-09-13 14:27:43,090 INFO L281 TraceCheckUtils]: 18: Hoare triple {9791#true} __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; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 17: Hoare triple {9791#true} assume !(0 == __VERIFIER_assert_~cond); {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 16: Hoare triple {9791#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; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 15: Hoare triple {9791#true} assume !(0 == __VERIFIER_assert_~cond); {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 14: Hoare triple {9791#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; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 13: Hoare triple {9791#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; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 12: Hoare triple {9791#true} assume !false; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 11: Hoare triple {9791#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 10: Hoare triple {9791#true} assume !false; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 9: Hoare triple {9791#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; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 8: Hoare triple {9791#true} assume !(0 == assume_abort_if_not_~cond); {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 7: Hoare triple {9791#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; {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 6: Hoare triple {9791#true} assume !(0 == assume_abort_if_not_~cond); {9791#true} is VALID [2021-09-13 14:27:43,091 INFO L281 TraceCheckUtils]: 5: Hoare triple {9791#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; {9791#true} is VALID [2021-09-13 14:27:43,092 INFO L281 TraceCheckUtils]: 4: Hoare triple {9791#true} assume !(0 == assume_abort_if_not_~cond); {9791#true} is VALID [2021-09-13 14:27:43,092 INFO L281 TraceCheckUtils]: 3: Hoare triple {9791#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9791#true} is VALID [2021-09-13 14:27:43,092 INFO L281 TraceCheckUtils]: 2: Hoare triple {9791#true} assume !(0 == assume_abort_if_not_~cond); {9791#true} is VALID [2021-09-13 14:27:43,092 INFO L281 TraceCheckUtils]: 1: Hoare triple {9791#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {9791#true} is VALID [2021-09-13 14:27:43,092 INFO L281 TraceCheckUtils]: 0: Hoare triple {9791#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); {9791#true} is VALID [2021-09-13 14:27:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:43,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:43,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779064794] [2021-09-13 14:27:43,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:43,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033021725] [2021-09-13 14:27:43,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033021725] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:43,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:43,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2021-09-13 14:27:43,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146379914] [2021-09-13 14:27:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:27:43,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:43,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:43,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:43,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:27:43,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:27:43,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:27:43,155 INFO L87 Difference]: Start difference. First operand 396 states and 497 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:45,933 INFO L93 Difference]: Finished difference Result 445 states and 556 transitions. [2021-09-13 14:27:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-09-13 14:27:45,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:27:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2021-09-13 14:27:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2021-09-13 14:27:45,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 111 transitions. [2021-09-13 14:27:46,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:46,062 INFO L225 Difference]: With dead ends: 445 [2021-09-13 14:27:46,063 INFO L226 Difference]: Without dead ends: 443 [2021-09-13 14:27:46,064 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 305.25ms TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2021-09-13 14:27:46,064 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 279.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.18ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 281.94ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:46,064 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 346 Unknown, 0 Unchecked, 2.18ms Time], IncrementalHoareTripleChecker [29 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 281.94ms Time] [2021-09-13 14:27:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-09-13 14:27:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 306. [2021-09-13 14:27:47,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:47,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 306 states, 302 states have (on average 1.2582781456953642) internal successors, (380), 305 states have internal predecessors, (380), 0 states have call successors, (0), 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:47,463 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 306 states, 302 states have (on average 1.2582781456953642) internal successors, (380), 305 states have internal predecessors, (380), 0 states have call successors, (0), 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:47,464 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 306 states, 302 states have (on average 1.2582781456953642) internal successors, (380), 305 states have internal predecessors, (380), 0 states have call successors, (0), 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:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:47,475 INFO L93 Difference]: Finished difference Result 443 states and 542 transitions. [2021-09-13 14:27:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 542 transitions. [2021-09-13 14:27:47,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:47,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:47,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 306 states, 302 states have (on average 1.2582781456953642) internal successors, (380), 305 states have internal predecessors, (380), 0 states have call successors, (0), 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 443 states. [2021-09-13 14:27:47,477 INFO L87 Difference]: Start difference. First operand has 306 states, 302 states have (on average 1.2582781456953642) internal successors, (380), 305 states have internal predecessors, (380), 0 states have call successors, (0), 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 443 states. [2021-09-13 14:27:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:47,488 INFO L93 Difference]: Finished difference Result 443 states and 542 transitions. [2021-09-13 14:27:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 542 transitions. [2021-09-13 14:27:47,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:47,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:47,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:47,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 302 states have (on average 1.2582781456953642) internal successors, (380), 305 states have internal predecessors, (380), 0 states have call successors, (0), 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:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 380 transitions. [2021-09-13 14:27:47,497 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 380 transitions. Word has length 32 [2021-09-13 14:27:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:47,498 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 380 transitions. [2021-09-13 14:27:47,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 380 transitions. [2021-09-13 14:27:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-09-13 14:27:47,499 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:47,499 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:27:47,525 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:27:47,712 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:27:47,713 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash 913672398, now seen corresponding path program 1 times [2021-09-13 14:27:47,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:47,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636915980] [2021-09-13 14:27:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:47,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:47,721 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:47,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229496580] [2021-09-13 14:27:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:47,722 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:47,724 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:27:47,725 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:27:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:47,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:27:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:47,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:47,957 INFO L281 TraceCheckUtils]: 0: Hoare triple {12000#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); {12000#true} is VALID [2021-09-13 14:27:47,957 INFO L281 TraceCheckUtils]: 1: Hoare triple {12000#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12000#true} is VALID [2021-09-13 14:27:47,957 INFO L281 TraceCheckUtils]: 2: Hoare triple {12000#true} assume !(0 == assume_abort_if_not_~cond); {12000#true} is VALID [2021-09-13 14:27:47,958 INFO L281 TraceCheckUtils]: 3: Hoare triple {12000#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12000#true} is VALID [2021-09-13 14:27:47,958 INFO L281 TraceCheckUtils]: 4: Hoare triple {12000#true} assume !(0 == assume_abort_if_not_~cond); {12000#true} is VALID [2021-09-13 14:27:47,958 INFO L281 TraceCheckUtils]: 5: Hoare triple {12000#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; {12000#true} is VALID [2021-09-13 14:27:47,958 INFO L281 TraceCheckUtils]: 6: Hoare triple {12000#true} assume !(0 == assume_abort_if_not_~cond); {12000#true} is VALID [2021-09-13 14:27:47,958 INFO L281 TraceCheckUtils]: 7: Hoare triple {12000#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; {12000#true} is VALID [2021-09-13 14:27:47,958 INFO L281 TraceCheckUtils]: 8: Hoare triple {12000#true} assume !(0 == assume_abort_if_not_~cond); {12000#true} is VALID [2021-09-13 14:27:47,959 INFO L281 TraceCheckUtils]: 9: Hoare triple {12000#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; {12000#true} is VALID [2021-09-13 14:27:47,959 INFO L281 TraceCheckUtils]: 10: Hoare triple {12000#true} assume !false; {12000#true} is VALID [2021-09-13 14:27:47,959 INFO L281 TraceCheckUtils]: 11: Hoare triple {12000#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {12000#true} is VALID [2021-09-13 14:27:47,959 INFO L281 TraceCheckUtils]: 12: Hoare triple {12000#true} assume !false; {12000#true} is VALID [2021-09-13 14:27:47,959 INFO L281 TraceCheckUtils]: 13: Hoare triple {12000#true} assume !(main_~c~0 >= main_~b~0); {12000#true} is VALID [2021-09-13 14:27:47,959 INFO L281 TraceCheckUtils]: 14: Hoare triple {12000#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; {12000#true} is VALID [2021-09-13 14:27:47,960 INFO L281 TraceCheckUtils]: 15: Hoare triple {12000#true} assume !false; {12000#true} is VALID [2021-09-13 14:27:47,960 INFO L281 TraceCheckUtils]: 16: Hoare triple {12000#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {12000#true} is VALID [2021-09-13 14:27:47,960 INFO L281 TraceCheckUtils]: 17: Hoare triple {12000#true} assume !false; {12000#true} is VALID [2021-09-13 14:27:47,962 INFO L281 TraceCheckUtils]: 18: Hoare triple {12000#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; {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,963 INFO L281 TraceCheckUtils]: 19: Hoare triple {12059#(<= 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; {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,963 INFO L281 TraceCheckUtils]: 20: Hoare triple {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,963 INFO L281 TraceCheckUtils]: 21: Hoare triple {12059#(<= 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; {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,964 INFO L281 TraceCheckUtils]: 22: Hoare triple {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,964 INFO L281 TraceCheckUtils]: 23: Hoare triple {12059#(<= 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; {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,965 INFO L281 TraceCheckUtils]: 24: Hoare triple {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,965 INFO L281 TraceCheckUtils]: 25: Hoare triple {12059#(<= 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; {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,965 INFO L281 TraceCheckUtils]: 26: Hoare triple {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,966 INFO L281 TraceCheckUtils]: 27: Hoare triple {12059#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= 2 * main_~v~0); {12087#(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:27:47,966 INFO L281 TraceCheckUtils]: 28: Hoare triple {12087#(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; {12091#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,967 INFO L281 TraceCheckUtils]: 29: Hoare triple {12091#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !false; {12091#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:47,967 INFO L281 TraceCheckUtils]: 30: Hoare triple {12091#(< 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; {12001#false} is VALID [2021-09-13 14:27:47,967 INFO L281 TraceCheckUtils]: 31: Hoare triple {12001#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; {12001#false} is VALID [2021-09-13 14:27:47,967 INFO L281 TraceCheckUtils]: 32: Hoare triple {12001#false} assume !(0 == __VERIFIER_assert_~cond); {12001#false} is VALID [2021-09-13 14:27:47,967 INFO L281 TraceCheckUtils]: 33: Hoare triple {12001#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; {12001#false} is VALID [2021-09-13 14:27:47,967 INFO L281 TraceCheckUtils]: 34: Hoare triple {12001#false} assume !(0 == __VERIFIER_assert_~cond); {12001#false} is VALID [2021-09-13 14:27:47,967 INFO L281 TraceCheckUtils]: 35: Hoare triple {12001#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; {12001#false} is VALID [2021-09-13 14:27:47,968 INFO L281 TraceCheckUtils]: 36: Hoare triple {12001#false} assume 0 == __VERIFIER_assert_~cond; {12001#false} is VALID [2021-09-13 14:27:47,968 INFO L281 TraceCheckUtils]: 37: Hoare triple {12001#false} assume !false; {12001#false} is VALID [2021-09-13 14:27:47,968 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:27:47,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:47,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:47,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636915980] [2021-09-13 14:27:47,968 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:47,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229496580] [2021-09-13 14:27:47,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229496580] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:47,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:47,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:27:47,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412627336] [2021-09-13 14:27:47,969 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:27:47,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:47,969 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:27:47,993 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:27:47,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:27:47,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:47,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:27:47,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:27:47,994 INFO L87 Difference]: Start difference. First operand 306 states and 380 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:27:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:50,314 INFO L93 Difference]: Finished difference Result 641 states and 805 transitions. [2021-09-13 14:27:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:27:50,314 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:27:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:50,315 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:27:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2021-09-13 14:27:50,316 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:27:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2021-09-13 14:27:50,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2021-09-13 14:27:50,381 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:27:50,395 INFO L225 Difference]: With dead ends: 641 [2021-09-13 14:27:50,395 INFO L226 Difference]: Without dead ends: 435 [2021-09-13 14:27:50,397 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.32ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:27:50,397 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.66ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.50ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:50,398 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.66ms Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 146.50ms Time] [2021-09-13 14:27:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-09-13 14:27:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 411. [2021-09-13 14:27:52,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:52,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 411 states, 407 states have (on average 1.2432432432432432) internal successors, (506), 410 states have internal predecessors, (506), 0 states have call successors, (0), 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:52,427 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 411 states, 407 states have (on average 1.2432432432432432) internal successors, (506), 410 states have internal predecessors, (506), 0 states have call successors, (0), 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:52,428 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 411 states, 407 states have (on average 1.2432432432432432) internal successors, (506), 410 states have internal predecessors, (506), 0 states have call successors, (0), 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:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:52,438 INFO L93 Difference]: Finished difference Result 435 states and 527 transitions. [2021-09-13 14:27:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 527 transitions. [2021-09-13 14:27:52,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:52,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:52,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 411 states, 407 states have (on average 1.2432432432432432) internal successors, (506), 410 states have internal predecessors, (506), 0 states have call successors, (0), 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 435 states. [2021-09-13 14:27:52,441 INFO L87 Difference]: Start difference. First operand has 411 states, 407 states have (on average 1.2432432432432432) internal successors, (506), 410 states have internal predecessors, (506), 0 states have call successors, (0), 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 435 states. [2021-09-13 14:27:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:52,452 INFO L93 Difference]: Finished difference Result 435 states and 527 transitions. [2021-09-13 14:27:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 527 transitions. [2021-09-13 14:27:52,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:52,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:52,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:52,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 407 states have (on average 1.2432432432432432) internal successors, (506), 410 states have internal predecessors, (506), 0 states have call successors, (0), 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:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 506 transitions. [2021-09-13 14:27:52,466 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 506 transitions. Word has length 38 [2021-09-13 14:27:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:52,466 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 506 transitions. [2021-09-13 14:27:52,467 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:27:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 506 transitions. [2021-09-13 14:27:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-09-13 14:27:52,467 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:52,468 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:27:52,499 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:27:52,680 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:27:52,681 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 820532868, now seen corresponding path program 2 times [2021-09-13 14:27:52,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:52,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945275143] [2021-09-13 14:27:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:52,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:52,699 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:52,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798969216] [2021-09-13 14:27:52,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:27:52,700 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:52,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:52,704 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:27:52,704 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:27:52,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-09-13 14:27:52,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:27:52,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 14:27:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:52,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:52,989 INFO L281 TraceCheckUtils]: 0: Hoare triple {14517#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); {14517#true} is VALID [2021-09-13 14:27:52,989 INFO L281 TraceCheckUtils]: 1: Hoare triple {14517#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14517#true} is VALID [2021-09-13 14:27:52,989 INFO L281 TraceCheckUtils]: 2: Hoare triple {14517#true} assume !(0 == assume_abort_if_not_~cond); {14517#true} is VALID [2021-09-13 14:27:52,989 INFO L281 TraceCheckUtils]: 3: Hoare triple {14517#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {14517#true} is VALID [2021-09-13 14:27:52,989 INFO L281 TraceCheckUtils]: 4: Hoare triple {14517#true} assume !(0 == assume_abort_if_not_~cond); {14517#true} is VALID [2021-09-13 14:27:52,989 INFO L281 TraceCheckUtils]: 5: Hoare triple {14517#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; {14517#true} is VALID [2021-09-13 14:27:52,989 INFO L281 TraceCheckUtils]: 6: Hoare triple {14517#true} assume !(0 == assume_abort_if_not_~cond); {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 7: Hoare triple {14517#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; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 8: Hoare triple {14517#true} assume !(0 == assume_abort_if_not_~cond); {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 9: Hoare triple {14517#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; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 10: Hoare triple {14517#true} assume !false; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 11: Hoare triple {14517#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 12: Hoare triple {14517#true} assume !false; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 13: Hoare triple {14517#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; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 14: Hoare triple {14517#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; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 15: Hoare triple {14517#true} assume !(0 == __VERIFIER_assert_~cond); {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 16: Hoare triple {14517#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; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 17: Hoare triple {14517#true} assume !(0 == __VERIFIER_assert_~cond); {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 18: Hoare triple {14517#true} __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; {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 19: Hoare triple {14517#true} assume !(0 == __VERIFIER_assert_~cond); {14517#true} is VALID [2021-09-13 14:27:52,990 INFO L281 TraceCheckUtils]: 20: Hoare triple {14517#true} __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; {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 21: Hoare triple {14517#true} assume !(0 == __VERIFIER_assert_~cond); {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 22: Hoare triple {14517#true} assume !(main_~c~0 >= 2 * main_~v~0); {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 23: Hoare triple {14517#true} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 24: Hoare triple {14517#true} assume !false; {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 25: Hoare triple {14517#true} assume !(main_~c~0 >= main_~b~0); {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 26: Hoare triple {14517#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; {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 27: Hoare triple {14517#true} assume !false; {14517#true} is VALID [2021-09-13 14:27:52,991 INFO L281 TraceCheckUtils]: 28: Hoare triple {14517#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {14606#(and (= ULTIMATE.start_main_~k~0 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:52,992 INFO L281 TraceCheckUtils]: 29: Hoare triple {14606#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !false; {14606#(and (= ULTIMATE.start_main_~k~0 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:52,993 INFO L281 TraceCheckUtils]: 30: Hoare triple {14606#(and (= ULTIMATE.start_main_~k~0 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; {14606#(and (= ULTIMATE.start_main_~k~0 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:52,994 INFO L281 TraceCheckUtils]: 31: Hoare triple {14606#(and (= ULTIMATE.start_main_~k~0 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; {14606#(and (= ULTIMATE.start_main_~k~0 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:52,994 INFO L281 TraceCheckUtils]: 32: Hoare triple {14606#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {14606#(and (= ULTIMATE.start_main_~k~0 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:52,995 INFO L281 TraceCheckUtils]: 33: Hoare triple {14606#(and (= ULTIMATE.start_main_~k~0 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; {14606#(and (= ULTIMATE.start_main_~k~0 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:52,995 INFO L281 TraceCheckUtils]: 34: Hoare triple {14606#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {14606#(and (= ULTIMATE.start_main_~k~0 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:52,996 INFO L281 TraceCheckUtils]: 35: Hoare triple {14606#(and (= ULTIMATE.start_main_~k~0 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; {14628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:52,996 INFO L281 TraceCheckUtils]: 36: Hoare triple {14628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {14518#false} is VALID [2021-09-13 14:27:52,996 INFO L281 TraceCheckUtils]: 37: Hoare triple {14518#false} assume !false; {14518#false} is VALID [2021-09-13 14:27:52,996 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:27:52,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:52,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:52,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945275143] [2021-09-13 14:27:52,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:52,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798969216] [2021-09-13 14:27:52,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798969216] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:52,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:52,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:27:52,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650858309] [2021-09-13 14:27:52,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 38 [2021-09-13 14:27:52,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:52,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:27:53,028 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:27:53,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:27:53,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:27:53,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:27:53,029 INFO L87 Difference]: Start difference. First operand 411 states and 506 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:27:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:55,896 INFO L93 Difference]: Finished difference Result 552 states and 688 transitions. [2021-09-13 14:27:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:27:55,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 38 [2021-09-13 14:27:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:27:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2021-09-13 14:27:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:27:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2021-09-13 14:27:55,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2021-09-13 14:27:55,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:55,949 INFO L225 Difference]: With dead ends: 552 [2021-09-13 14:27:55,949 INFO L226 Difference]: Without dead ends: 550 [2021-09-13 14:27:55,949 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.85ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:27:55,950 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.49ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.91ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:55,950 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.49ms Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 77.91ms Time] [2021-09-13 14:27:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-09-13 14:27:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 532. [2021-09-13 14:27:58,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:58,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 550 states. Second operand has 532 states, 528 states have (on average 1.2386363636363635) internal successors, (654), 531 states have internal predecessors, (654), 0 states have call successors, (0), 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:58,815 INFO L74 IsIncluded]: Start isIncluded. First operand 550 states. Second operand has 532 states, 528 states have (on average 1.2386363636363635) internal successors, (654), 531 states have internal predecessors, (654), 0 states have call successors, (0), 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:58,815 INFO L87 Difference]: Start difference. First operand 550 states. Second operand has 532 states, 528 states have (on average 1.2386363636363635) internal successors, (654), 531 states have internal predecessors, (654), 0 states have call successors, (0), 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:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:58,825 INFO L93 Difference]: Finished difference Result 550 states and 670 transitions. [2021-09-13 14:27:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 670 transitions. [2021-09-13 14:27:58,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:58,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:58,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 528 states have (on average 1.2386363636363635) internal successors, (654), 531 states have internal predecessors, (654), 0 states have call successors, (0), 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 550 states. [2021-09-13 14:27:58,827 INFO L87 Difference]: Start difference. First operand has 532 states, 528 states have (on average 1.2386363636363635) internal successors, (654), 531 states have internal predecessors, (654), 0 states have call successors, (0), 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 550 states. [2021-09-13 14:27:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:58,839 INFO L93 Difference]: Finished difference Result 550 states and 670 transitions. [2021-09-13 14:27:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 670 transitions. [2021-09-13 14:27:58,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:58,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:58,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:58,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 528 states have (on average 1.2386363636363635) internal successors, (654), 531 states have internal predecessors, (654), 0 states have call successors, (0), 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:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 654 transitions. [2021-09-13 14:27:58,856 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 654 transitions. Word has length 38 [2021-09-13 14:27:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:58,856 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 654 transitions. [2021-09-13 14:27:58,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:27:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 654 transitions. [2021-09-13 14:27:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-09-13 14:27:58,857 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:58,857 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:27:58,875 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:27:59,065 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:27:59,066 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash -795421979, now seen corresponding path program 1 times [2021-09-13 14:27:59,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:59,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076344977] [2021-09-13 14:27:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:59,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:59,074 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:59,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450916720] [2021-09-13 14:27:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:59,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:59,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:59,086 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:27:59,099 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:27:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:59,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:27:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:59,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 0: Hoare triple {17332#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); {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 1: Hoare triple {17332#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 2: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 3: Hoare triple {17332#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 4: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 5: Hoare triple {17332#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; {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 6: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 7: Hoare triple {17332#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; {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 8: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,400 INFO L281 TraceCheckUtils]: 9: Hoare triple {17332#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; {17332#true} is VALID [2021-09-13 14:27:59,401 INFO L281 TraceCheckUtils]: 10: Hoare triple {17332#true} assume !false; {17332#true} is VALID [2021-09-13 14:27:59,401 INFO L281 TraceCheckUtils]: 11: Hoare triple {17332#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {17332#true} is VALID [2021-09-13 14:27:59,401 INFO L281 TraceCheckUtils]: 12: Hoare triple {17332#true} assume !false; {17332#true} is VALID [2021-09-13 14:27:59,401 INFO L281 TraceCheckUtils]: 13: Hoare triple {17332#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; {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,401 INFO L281 TraceCheckUtils]: 14: Hoare triple {17376#(<= 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; {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,402 INFO L281 TraceCheckUtils]: 15: Hoare triple {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,402 INFO L281 TraceCheckUtils]: 16: Hoare triple {17376#(<= 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; {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,402 INFO L281 TraceCheckUtils]: 17: Hoare triple {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,402 INFO L281 TraceCheckUtils]: 18: Hoare triple {17376#(<= 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; {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,403 INFO L281 TraceCheckUtils]: 19: Hoare triple {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,403 INFO L281 TraceCheckUtils]: 20: Hoare triple {17376#(<= 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; {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,403 INFO L281 TraceCheckUtils]: 21: Hoare triple {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,404 INFO L281 TraceCheckUtils]: 22: Hoare triple {17376#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= 2 * main_~v~0); {17404#(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:27:59,404 INFO L281 TraceCheckUtils]: 23: Hoare triple {17404#(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; {17408#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,405 INFO L281 TraceCheckUtils]: 24: Hoare triple {17408#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !false; {17408#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,405 INFO L281 TraceCheckUtils]: 25: Hoare triple {17408#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= main_~b~0); {17408#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,405 INFO L281 TraceCheckUtils]: 26: Hoare triple {17408#(< 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; {17418#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:59,406 INFO L281 TraceCheckUtils]: 27: Hoare triple {17418#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !false; {17418#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:59,406 INFO L281 TraceCheckUtils]: 28: Hoare triple {17418#(< 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; {17425#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:59,406 INFO L281 TraceCheckUtils]: 29: Hoare triple {17425#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !false; {17425#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:59,407 INFO L281 TraceCheckUtils]: 30: Hoare triple {17425#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {17333#false} is VALID [2021-09-13 14:27:59,407 INFO L281 TraceCheckUtils]: 31: Hoare triple {17333#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; {17333#false} is VALID [2021-09-13 14:27:59,407 INFO L281 TraceCheckUtils]: 32: Hoare triple {17333#false} assume !false; {17333#false} is VALID [2021-09-13 14:27:59,407 INFO L281 TraceCheckUtils]: 33: Hoare triple {17333#false} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {17333#false} is VALID [2021-09-13 14:27:59,407 INFO L281 TraceCheckUtils]: 34: Hoare triple {17333#false} assume !false; {17333#false} is VALID [2021-09-13 14:27:59,407 INFO L281 TraceCheckUtils]: 35: Hoare triple {17333#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; {17333#false} is VALID [2021-09-13 14:27:59,407 INFO L281 TraceCheckUtils]: 36: Hoare triple {17333#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; {17333#false} is VALID [2021-09-13 14:27:59,408 INFO L281 TraceCheckUtils]: 37: Hoare triple {17333#false} assume 0 == __VERIFIER_assert_~cond; {17333#false} is VALID [2021-09-13 14:27:59,408 INFO L281 TraceCheckUtils]: 38: Hoare triple {17333#false} assume !false; {17333#false} is VALID [2021-09-13 14:27:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:59,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:59,662 INFO L281 TraceCheckUtils]: 38: Hoare triple {17333#false} assume !false; {17333#false} is VALID [2021-09-13 14:27:59,662 INFO L281 TraceCheckUtils]: 37: Hoare triple {17333#false} assume 0 == __VERIFIER_assert_~cond; {17333#false} is VALID [2021-09-13 14:27:59,662 INFO L281 TraceCheckUtils]: 36: Hoare triple {17333#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; {17333#false} is VALID [2021-09-13 14:27:59,662 INFO L281 TraceCheckUtils]: 35: Hoare triple {17333#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; {17333#false} is VALID [2021-09-13 14:27:59,662 INFO L281 TraceCheckUtils]: 34: Hoare triple {17333#false} assume !false; {17333#false} is VALID [2021-09-13 14:27:59,663 INFO L281 TraceCheckUtils]: 33: Hoare triple {17333#false} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {17333#false} is VALID [2021-09-13 14:27:59,663 INFO L281 TraceCheckUtils]: 32: Hoare triple {17333#false} assume !false; {17333#false} is VALID [2021-09-13 14:27:59,663 INFO L281 TraceCheckUtils]: 31: Hoare triple {17333#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; {17333#false} is VALID [2021-09-13 14:27:59,663 INFO L281 TraceCheckUtils]: 30: Hoare triple {17480#(<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {17333#false} is VALID [2021-09-13 14:27:59,663 INFO L281 TraceCheckUtils]: 29: Hoare triple {17480#(<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !false; {17480#(<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:59,664 INFO L281 TraceCheckUtils]: 28: Hoare triple {17487#(<= 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; {17480#(<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:27:59,664 INFO L281 TraceCheckUtils]: 27: Hoare triple {17487#(<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !false; {17487#(<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:59,664 INFO L281 TraceCheckUtils]: 26: Hoare triple {17494#(<= 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; {17487#(<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:27:59,665 INFO L281 TraceCheckUtils]: 25: Hoare triple {17494#(<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= main_~b~0); {17494#(<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,665 INFO L281 TraceCheckUtils]: 24: Hoare triple {17494#(<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !false; {17494#(<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,668 INFO L281 TraceCheckUtils]: 23: Hoare triple {17504#(<= ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {17494#(<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:59,669 INFO L281 TraceCheckUtils]: 22: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} assume !(main_~c~0 >= 2 * main_~v~0); {17504#(<= ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0))} is VALID [2021-09-13 14:27:59,670 INFO L281 TraceCheckUtils]: 21: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} assume !(0 == __VERIFIER_assert_~cond); {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,671 INFO L281 TraceCheckUtils]: 20: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~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; {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,671 INFO L281 TraceCheckUtils]: 19: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} assume !(0 == __VERIFIER_assert_~cond); {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,671 INFO L281 TraceCheckUtils]: 18: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~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; {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,672 INFO L281 TraceCheckUtils]: 17: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} assume !(0 == __VERIFIER_assert_~cond); {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,672 INFO L281 TraceCheckUtils]: 16: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~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; {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,672 INFO L281 TraceCheckUtils]: 15: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} assume !(0 == __VERIFIER_assert_~cond); {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 14: Hoare triple {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~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; {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 13: Hoare triple {17332#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; {17508#(<= ULTIMATE.start_main_~v~0 (+ ULTIMATE.start_main_~b~0 1))} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 12: Hoare triple {17332#true} assume !false; {17332#true} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 11: Hoare triple {17332#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {17332#true} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 10: Hoare triple {17332#true} assume !false; {17332#true} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 9: Hoare triple {17332#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; {17332#true} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 8: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 7: Hoare triple {17332#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; {17332#true} is VALID [2021-09-13 14:27:59,673 INFO L281 TraceCheckUtils]: 6: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,674 INFO L281 TraceCheckUtils]: 5: Hoare triple {17332#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; {17332#true} is VALID [2021-09-13 14:27:59,674 INFO L281 TraceCheckUtils]: 4: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,674 INFO L281 TraceCheckUtils]: 3: Hoare triple {17332#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {17332#true} is VALID [2021-09-13 14:27:59,674 INFO L281 TraceCheckUtils]: 2: Hoare triple {17332#true} assume !(0 == assume_abort_if_not_~cond); {17332#true} is VALID [2021-09-13 14:27:59,674 INFO L281 TraceCheckUtils]: 1: Hoare triple {17332#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {17332#true} is VALID [2021-09-13 14:27:59,674 INFO L281 TraceCheckUtils]: 0: Hoare triple {17332#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); {17332#true} is VALID [2021-09-13 14:27:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:59,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:59,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076344977] [2021-09-13 14:27:59,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:59,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450916720] [2021-09-13 14:27:59,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450916720] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:59,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:59,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-09-13 14:27:59,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960689437] [2021-09-13 14:27:59,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 39 [2021-09-13 14:27:59,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:59,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:27:59,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:59,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:27:59,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:59,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:27:59,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:27:59,722 INFO L87 Difference]: Start difference. First operand 532 states and 654 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:28:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:02,375 INFO L93 Difference]: Finished difference Result 693 states and 838 transitions. [2021-09-13 14:28:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-13 14:28:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 39 [2021-09-13 14:28:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:28:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 152 transitions. [2021-09-13 14:28:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:28:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 152 transitions. [2021-09-13 14:28:02,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 152 transitions. [2021-09-13 14:28:02,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:02,531 INFO L225 Difference]: With dead ends: 693 [2021-09-13 14:28:02,531 INFO L226 Difference]: Without dead ends: 333 [2021-09-13 14:28:02,535 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 209.84ms TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2021-09-13 14:28:02,538 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 296.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.12ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 299.56ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:02,540 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 2.12ms Time], IncrementalHoareTripleChecker [16 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 299.56ms Time] [2021-09-13 14:28:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-09-13 14:28:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 306. [2021-09-13 14:28:04,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:04,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 306 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 305 states have internal predecessors, (360), 0 states have call successors, (0), 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:28:04,383 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 306 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 305 states have internal predecessors, (360), 0 states have call successors, (0), 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:28:04,383 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 306 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 305 states have internal predecessors, (360), 0 states have call successors, (0), 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:28:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:04,389 INFO L93 Difference]: Finished difference Result 333 states and 378 transitions. [2021-09-13 14:28:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 378 transitions. [2021-09-13 14:28:04,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:04,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:04,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 306 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 305 states have internal predecessors, (360), 0 states have call successors, (0), 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 333 states. [2021-09-13 14:28:04,390 INFO L87 Difference]: Start difference. First operand has 306 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 305 states have internal predecessors, (360), 0 states have call successors, (0), 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 333 states. [2021-09-13 14:28:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:04,394 INFO L93 Difference]: Finished difference Result 333 states and 378 transitions. [2021-09-13 14:28:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 378 transitions. [2021-09-13 14:28:04,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:04,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:04,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:04,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 305 states have internal predecessors, (360), 0 states have call successors, (0), 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:28:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 360 transitions. [2021-09-13 14:28:04,402 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 360 transitions. Word has length 39 [2021-09-13 14:28:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:04,402 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 360 transitions. [2021-09-13 14:28:04,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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:28:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 360 transitions. [2021-09-13 14:28:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:28:04,403 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:04,403 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:28:04,422 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:28:04,605 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:28:04,606 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:28:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:04,606 INFO L82 PathProgramCache]: Analyzing trace with hash 274679198, now seen corresponding path program 1 times [2021-09-13 14:28:04,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:04,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819529938] [2021-09-13 14:28:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:04,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:04,621 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:04,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408262915] [2021-09-13 14:28:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:04,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:04,623 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:28:04,624 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:28:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:04,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 73 conjunts are in the unsatisfiable core [2021-09-13 14:28:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:04,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:06,708 INFO L281 TraceCheckUtils]: 0: Hoare triple {19729#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); {19729#true} is VALID [2021-09-13 14:28:06,708 INFO L281 TraceCheckUtils]: 1: Hoare triple {19729#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 2: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 3: Hoare triple {19729#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 4: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 5: Hoare triple {19729#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; {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 6: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 7: Hoare triple {19729#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; {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 8: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:06,709 INFO L281 TraceCheckUtils]: 9: Hoare triple {19729#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; {19761#(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:28:06,710 INFO L281 TraceCheckUtils]: 10: Hoare triple {19761#(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; {19761#(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:28:06,710 INFO L281 TraceCheckUtils]: 11: Hoare triple {19761#(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; {19768#(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:28:06,711 INFO L281 TraceCheckUtils]: 12: Hoare triple {19768#(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; {19768#(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:28:06,711 INFO L281 TraceCheckUtils]: 13: Hoare triple {19768#(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); {19775#(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:28:06,712 INFO L281 TraceCheckUtils]: 14: Hoare triple {19775#(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; {19779#(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_~x~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:28:06,712 INFO L281 TraceCheckUtils]: 15: Hoare triple {19779#(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_~x~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; {19779#(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_~x~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:28:06,712 INFO L281 TraceCheckUtils]: 16: Hoare triple {19779#(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_~x~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; {19786#(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_~x~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:28:06,713 INFO L281 TraceCheckUtils]: 17: Hoare triple {19786#(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_~x~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; {19786#(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_~x~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:28:06,713 INFO L281 TraceCheckUtils]: 18: Hoare triple {19786#(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_~x~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; {19793#(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_~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 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:28:06,714 INFO L281 TraceCheckUtils]: 19: Hoare triple {19793#(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_~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 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; {19793#(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_~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 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:28:06,714 INFO L281 TraceCheckUtils]: 20: Hoare triple {19793#(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_~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 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); {19793#(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_~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 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:28:06,715 INFO L281 TraceCheckUtils]: 21: Hoare triple {19793#(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_~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 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; {19793#(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_~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 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:28:06,715 INFO L281 TraceCheckUtils]: 22: Hoare triple {19793#(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_~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 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); {19793#(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_~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 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:28:06,716 INFO L281 TraceCheckUtils]: 23: Hoare triple {19793#(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_~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 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; {19809#(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:28:06,716 INFO L281 TraceCheckUtils]: 24: Hoare triple {19809#(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); {19813#(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:28:06,717 INFO L281 TraceCheckUtils]: 25: Hoare triple {19813#(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; {19813#(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:28:06,717 INFO L281 TraceCheckUtils]: 26: Hoare triple {19813#(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); {19813#(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:28:06,718 INFO L281 TraceCheckUtils]: 27: Hoare triple {19813#(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); {19823#(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:28:06,719 INFO L281 TraceCheckUtils]: 28: Hoare triple {19823#(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; {19827#(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:28:06,719 INFO L281 TraceCheckUtils]: 29: Hoare triple {19827#(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; {19827#(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:28:06,720 INFO L281 TraceCheckUtils]: 30: Hoare triple {19827#(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); {19827#(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:28:06,720 INFO L281 TraceCheckUtils]: 31: Hoare triple {19827#(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; {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:28:06,721 INFO L281 TraceCheckUtils]: 32: Hoare triple {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} assume !false; {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:28:06,721 INFO L281 TraceCheckUtils]: 33: Hoare triple {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:28:06,722 INFO L281 TraceCheckUtils]: 34: Hoare triple {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} assume !false; {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:28:06,722 INFO L281 TraceCheckUtils]: 35: Hoare triple {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~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; {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:28:06,723 INFO L281 TraceCheckUtils]: 36: Hoare triple {19837#(and (< (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~a~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_~y~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)) (= (+ ULTIMATE.start_main_~q~0 1) 0) (= ULTIMATE.start_main_~r~0 0) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) ULTIMATE.start_main_~s~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; {19853#(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:28:06,723 INFO L281 TraceCheckUtils]: 37: Hoare triple {19853#(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); {19857#(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:28:06,724 INFO L281 TraceCheckUtils]: 38: Hoare triple {19857#(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; {19861#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:28:06,724 INFO L281 TraceCheckUtils]: 39: Hoare triple {19861#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {19730#false} is VALID [2021-09-13 14:28:06,724 INFO L281 TraceCheckUtils]: 40: Hoare triple {19730#false} assume !false; {19730#false} is VALID [2021-09-13 14:28:06,724 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:28:06,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:09,326 INFO L281 TraceCheckUtils]: 40: Hoare triple {19730#false} assume !false; {19730#false} is VALID [2021-09-13 14:28:09,326 INFO L281 TraceCheckUtils]: 39: Hoare triple {19861#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {19730#false} is VALID [2021-09-13 14:28:09,327 INFO L281 TraceCheckUtils]: 38: Hoare triple {19874#(= (+ (* 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; {19861#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:28:09,327 INFO L281 TraceCheckUtils]: 37: Hoare triple {19878#(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); {19874#(= (+ (* 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:28:09,328 INFO L281 TraceCheckUtils]: 36: Hoare triple {19882#(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; {19878#(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:28:09,328 INFO L281 TraceCheckUtils]: 35: Hoare triple {19882#(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; {19882#(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:28:09,328 INFO L281 TraceCheckUtils]: 34: Hoare triple {19882#(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; {19882#(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:28:09,329 INFO L281 TraceCheckUtils]: 33: Hoare triple {19882#(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; {19882#(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:28:09,329 INFO L281 TraceCheckUtils]: 32: Hoare triple {19882#(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; {19882#(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:28:09,515 INFO L281 TraceCheckUtils]: 31: Hoare triple {19898#(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; {19882#(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:28:09,516 INFO L281 TraceCheckUtils]: 30: Hoare triple {19898#(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); {19898#(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:28:09,516 INFO L281 TraceCheckUtils]: 29: Hoare triple {19898#(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; {19898#(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:28:09,521 INFO L281 TraceCheckUtils]: 28: Hoare triple {19908#(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; {19898#(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:28:09,522 INFO L281 TraceCheckUtils]: 27: Hoare triple {19912#(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); {19908#(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:28:09,522 INFO L281 TraceCheckUtils]: 26: Hoare triple {19912#(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); {19912#(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:28:09,523 INFO L281 TraceCheckUtils]: 25: Hoare triple {19912#(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; {19912#(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:28:09,523 INFO L281 TraceCheckUtils]: 24: Hoare triple {19922#(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); {19912#(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:28:09,524 INFO L281 TraceCheckUtils]: 23: Hoare triple {19926#(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_~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; {19922#(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:28:09,524 INFO L281 TraceCheckUtils]: 22: Hoare triple {19926#(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_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)))} assume !(0 == __VERIFIER_assert_~cond); {19926#(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_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:28:09,524 INFO L281 TraceCheckUtils]: 21: Hoare triple {19926#(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_~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; {19926#(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_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:28:09,524 INFO L281 TraceCheckUtils]: 20: Hoare triple {19926#(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_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)))} assume !(0 == __VERIFIER_assert_~cond); {19926#(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_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:28:09,525 INFO L281 TraceCheckUtils]: 19: Hoare triple {19926#(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_~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; {19926#(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_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:28:09,525 INFO L281 TraceCheckUtils]: 18: Hoare triple {19942#(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) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~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))))} 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; {19926#(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_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:28:09,526 INFO L281 TraceCheckUtils]: 17: Hoare triple {19942#(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) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~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))))} assume !false; {19942#(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) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~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))))} is VALID [2021-09-13 14:28:09,526 INFO L281 TraceCheckUtils]: 16: Hoare triple {19949#(or (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~a~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)) (= (+ 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)) (+ 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 !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {19942#(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) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~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))))} is VALID [2021-09-13 14:28:09,527 INFO L281 TraceCheckUtils]: 15: Hoare triple {19949#(or (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~a~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)) (= (+ 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)) (+ 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; {19949#(or (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~a~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)) (= (+ 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)) (+ 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:28:09,609 INFO L281 TraceCheckUtils]: 14: Hoare triple {19956#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))) (not (= (+ 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; {19949#(or (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~a~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)) (= (+ 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)) (+ 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:28:09,610 INFO L281 TraceCheckUtils]: 13: Hoare triple {19960#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))) (not (= (+ 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); {19956#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))) (not (= (+ 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:28:09,610 INFO L281 TraceCheckUtils]: 12: Hoare triple {19960#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))) (not (= (+ 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; {19960#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))) (not (= (+ 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:28:09,611 INFO L281 TraceCheckUtils]: 11: Hoare triple {19967#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~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; {19960#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))) (not (= (+ 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:28:09,611 INFO L281 TraceCheckUtils]: 10: Hoare triple {19967#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~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; {19967#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~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:28:09,612 INFO L281 TraceCheckUtils]: 9: Hoare triple {19729#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; {19967#(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) (<= (+ (* 2 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0)) (* 2 (* ULTIMATE.start_main_~p~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:28:09,612 INFO L281 TraceCheckUtils]: 8: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 7: Hoare triple {19729#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; {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 6: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 5: Hoare triple {19729#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; {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 4: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 3: Hoare triple {19729#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 2: Hoare triple {19729#true} assume !(0 == assume_abort_if_not_~cond); {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 1: Hoare triple {19729#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {19729#true} is VALID [2021-09-13 14:28:09,612 INFO L281 TraceCheckUtils]: 0: Hoare triple {19729#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); {19729#true} is VALID [2021-09-13 14:28:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:09,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:09,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819529938] [2021-09-13 14:28:09,613 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:09,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408262915] [2021-09-13 14:28:09,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408262915] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:09,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:09,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2021-09-13 14:28:09,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550201902] [2021-09-13 14:28:09,614 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 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:28:09,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:09,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 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:28:09,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:09,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-09-13 14:28:09,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:09,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-09-13 14:28:09,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2021-09-13 14:28:09,904 INFO L87 Difference]: Start difference. First operand 306 states and 360 transitions. Second operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 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:28:49,221 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:28:53,293 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:29:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:02,844 INFO L93 Difference]: Finished difference Result 395 states and 460 transitions. [2021-09-13 14:29:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-09-13 14:29:02,845 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 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:29:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:29:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 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:29:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 196 transitions. [2021-09-13 14:29:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 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:29:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 196 transitions. [2021-09-13 14:29:02,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 196 transitions. [2021-09-13 14:29:06,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 195 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:29:06,352 INFO L225 Difference]: With dead ends: 395 [2021-09-13 14:29:06,352 INFO L226 Difference]: Without dead ends: 391 [2021-09-13 14:29:06,353 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 15275.63ms TimeCoverageRelationStatistics Valid=1004, Invalid=2902, Unknown=0, NotChecked=0, Total=3906 [2021-09-13 14:29:06,354 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 569 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 319 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11357.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.43ms SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11376.44ms IncrementalHoareTripleChecker+Time [2021-09-13 14:29:06,354 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 0 Invalid, 1252 Unknown, 0 Unchecked, 9.43ms Time], IncrementalHoareTripleChecker [319 Valid, 932 Invalid, 1 Unknown, 0 Unchecked, 11376.44ms Time] [2021-09-13 14:29:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-09-13 14:29:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 338. [2021-09-13 14:29:08,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:29:08,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 338 states, 334 states have (on average 1.152694610778443) internal successors, (385), 337 states have internal predecessors, (385), 0 states have call successors, (0), 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:29:08,864 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 338 states, 334 states have (on average 1.152694610778443) internal successors, (385), 337 states have internal predecessors, (385), 0 states have call successors, (0), 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:29:08,865 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 338 states, 334 states have (on average 1.152694610778443) internal successors, (385), 337 states have internal predecessors, (385), 0 states have call successors, (0), 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:29:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:08,871 INFO L93 Difference]: Finished difference Result 391 states and 438 transitions. [2021-09-13 14:29:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 438 transitions. [2021-09-13 14:29:08,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:08,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:08,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 334 states have (on average 1.152694610778443) internal successors, (385), 337 states have internal predecessors, (385), 0 states have call successors, (0), 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 391 states. [2021-09-13 14:29:08,873 INFO L87 Difference]: Start difference. First operand has 338 states, 334 states have (on average 1.152694610778443) internal successors, (385), 337 states have internal predecessors, (385), 0 states have call successors, (0), 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 391 states. [2021-09-13 14:29:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:08,881 INFO L93 Difference]: Finished difference Result 391 states and 438 transitions. [2021-09-13 14:29:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 438 transitions. [2021-09-13 14:29:08,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:08,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:08,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:29:08,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:29:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 334 states have (on average 1.152694610778443) internal successors, (385), 337 states have internal predecessors, (385), 0 states have call successors, (0), 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:29:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 385 transitions. [2021-09-13 14:29:08,891 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 385 transitions. Word has length 41 [2021-09-13 14:29:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:29:08,891 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 385 transitions. [2021-09-13 14:29:08,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 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:29:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 385 transitions. [2021-09-13 14:29:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-09-13 14:29:08,892 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:29:08,892 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:29:08,921 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:29:09,108 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:29:09,109 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:29:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:29:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1976752845, now seen corresponding path program 1 times [2021-09-13 14:29:09,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:29:09,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220718736] [2021-09-13 14:29:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:29:09,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:29:09,123 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:29:09,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271002947] [2021-09-13 14:29:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:29:09,125 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:29:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:29:09,132 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:29:09,138 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:29:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:09,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 80 conjunts are in the unsatisfiable core [2021-09-13 14:29:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:09,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:29:48,805 INFO L281 TraceCheckUtils]: 0: Hoare triple {21918#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); {21918#true} is VALID [2021-09-13 14:29:48,805 INFO L281 TraceCheckUtils]: 1: Hoare triple {21918#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {21918#true} is VALID [2021-09-13 14:29:48,805 INFO L281 TraceCheckUtils]: 2: Hoare triple {21918#true} assume !(0 == assume_abort_if_not_~cond); {21918#true} is VALID [2021-09-13 14:29:48,805 INFO L281 TraceCheckUtils]: 3: Hoare triple {21918#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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {21918#true} is VALID [2021-09-13 14:29:48,805 INFO L281 TraceCheckUtils]: 4: Hoare triple {21918#true} assume !(0 == assume_abort_if_not_~cond); {21918#true} is VALID [2021-09-13 14:29:48,805 INFO L281 TraceCheckUtils]: 5: Hoare triple {21918#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; {21918#true} is VALID [2021-09-13 14:29:48,806 INFO L281 TraceCheckUtils]: 6: Hoare triple {21918#true} assume !(0 == assume_abort_if_not_~cond); {21918#true} is VALID [2021-09-13 14:29:48,806 INFO L281 TraceCheckUtils]: 7: Hoare triple {21918#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; {21918#true} is VALID [2021-09-13 14:29:48,806 INFO L281 TraceCheckUtils]: 8: Hoare triple {21918#true} assume !(0 == assume_abort_if_not_~cond); {21918#true} is VALID [2021-09-13 14:29:48,807 INFO L281 TraceCheckUtils]: 9: Hoare triple {21918#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; {21950#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~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:29:48,807 INFO L281 TraceCheckUtils]: 10: Hoare triple {21950#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~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; {21950#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~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:29:48,808 INFO L281 TraceCheckUtils]: 11: Hoare triple {21950#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~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 !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {21957#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 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:29:48,808 INFO L281 TraceCheckUtils]: 12: Hoare triple {21957#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 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; {21957#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 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:29:48,809 INFO L281 TraceCheckUtils]: 13: Hoare triple {21957#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 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); {21957#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 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:29:48,809 INFO L281 TraceCheckUtils]: 14: Hoare triple {21957#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 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))} 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; {21967#(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))} is VALID [2021-09-13 14:29:48,809 INFO L281 TraceCheckUtils]: 15: Hoare triple {21967#(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))} assume !false; {21967#(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))} is VALID [2021-09-13 14:29:48,810 INFO L281 TraceCheckUtils]: 16: Hoare triple {21967#(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))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {21974#(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))} is VALID [2021-09-13 14:29:48,810 INFO L281 TraceCheckUtils]: 17: Hoare triple {21974#(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))} assume !false; {21974#(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))} is VALID [2021-09-13 14:29:48,811 INFO L281 TraceCheckUtils]: 18: Hoare triple {21974#(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))} 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; {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,811 INFO L281 TraceCheckUtils]: 19: Hoare triple {21981#(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_~r~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; {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,812 INFO L281 TraceCheckUtils]: 20: Hoare triple {21981#(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_~r~0 1))} assume !(0 == __VERIFIER_assert_~cond); {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,812 INFO L281 TraceCheckUtils]: 21: Hoare triple {21981#(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_~r~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; {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,812 INFO L281 TraceCheckUtils]: 22: Hoare triple {21981#(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_~r~0 1))} assume !(0 == __VERIFIER_assert_~cond); {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,813 INFO L281 TraceCheckUtils]: 23: Hoare triple {21981#(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_~r~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; {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,813 INFO L281 TraceCheckUtils]: 24: Hoare triple {21981#(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_~r~0 1))} assume !(0 == __VERIFIER_assert_~cond); {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,814 INFO L281 TraceCheckUtils]: 25: Hoare triple {21981#(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_~r~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; {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,814 INFO L281 TraceCheckUtils]: 26: Hoare triple {21981#(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_~r~0 1))} assume !(0 == __VERIFIER_assert_~cond); {21981#(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_~r~0 1))} is VALID [2021-09-13 14:29:48,815 INFO L281 TraceCheckUtils]: 27: Hoare triple {21981#(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_~r~0 1))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {22009#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1))} is VALID [2021-09-13 14:29:48,816 INFO L281 TraceCheckUtils]: 28: Hoare triple {22009#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~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; {22013#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1))} is VALID [2021-09-13 14:29:48,816 INFO L281 TraceCheckUtils]: 29: Hoare triple {22013#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1))} assume !(0 == __VERIFIER_assert_~cond); {22017#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~0 1))} is VALID [2021-09-13 14:29:48,817 INFO L281 TraceCheckUtils]: 30: Hoare triple {22017#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~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; {22021#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (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_~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_~r~0 1))} is VALID [2021-09-13 14:29:48,817 INFO L281 TraceCheckUtils]: 31: Hoare triple {22021#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (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_~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_~r~0 1))} assume !(0 == __VERIFIER_assert_~cond); {22025#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~0 1))} is VALID [2021-09-13 14:29:48,818 INFO L281 TraceCheckUtils]: 32: Hoare triple {22025#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~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; {22025#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~0 1))} is VALID [2021-09-13 14:29:48,818 INFO L281 TraceCheckUtils]: 33: Hoare triple {22025#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~0 1))} assume !(0 == __VERIFIER_assert_~cond); {22025#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~0 1))} is VALID [2021-09-13 14:29:48,819 INFO L281 TraceCheckUtils]: 34: Hoare triple {22025#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~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; {22035#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~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))))} is VALID [2021-09-13 14:29:48,820 INFO L281 TraceCheckUtils]: 35: Hoare triple {22035#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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_~r~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))))} assume !(0 == __VERIFIER_assert_~cond); {22039#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~r~0 1))} is VALID [2021-09-13 14:29:48,820 INFO L281 TraceCheckUtils]: 36: Hoare triple {22039#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~r~0 1))} assume !(main_~c~0 >= 2 * main_~v~0); {22039#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~r~0 1))} is VALID [2021-09-13 14:29:48,823 INFO L281 TraceCheckUtils]: 37: Hoare triple {22039#(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) (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (= 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 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~r~0 1))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {22046#(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_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 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_~r~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:29:48,824 INFO L281 TraceCheckUtils]: 38: Hoare triple {22046#(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_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 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_~r~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !false; {22046#(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_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 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_~r~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:29:48,824 INFO L281 TraceCheckUtils]: 39: Hoare triple {22046#(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_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 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_~r~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {22046#(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_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 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_~r~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:29:48,833 INFO L281 TraceCheckUtils]: 40: Hoare triple {22046#(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_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 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_~r~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~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; {22056#(and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (or (= ULTIMATE.start_main_~q~0 (* 2 (* ULTIMATE.start_main_~p~0 (div (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))) (= 0 (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:29:48,833 INFO L281 TraceCheckUtils]: 41: Hoare triple {22056#(and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (or (= ULTIMATE.start_main_~q~0 (* 2 (* ULTIMATE.start_main_~p~0 (div (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))) (= 0 (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !false; {22056#(and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (or (= ULTIMATE.start_main_~q~0 (* 2 (* ULTIMATE.start_main_~p~0 (div (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))) (= 0 (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:29:48,834 INFO L281 TraceCheckUtils]: 42: Hoare triple {22056#(and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (or (= ULTIMATE.start_main_~q~0 (* 2 (* ULTIMATE.start_main_~p~0 (div (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))) (= 0 (div (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 (- 1))) 2))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 != main_~b~0); {22063#(and (or (= ULTIMATE.start_main_~q~0 (* 2 (* ULTIMATE.start_main_~p~0 (div (div (* ULTIMATE.start_main_~y~0 (- 1)) 2) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))) (= (div (* ULTIMATE.start_main_~y~0 (- 1)) 2) 0)) (= ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~y~0 (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:29:48,840 INFO L281 TraceCheckUtils]: 43: Hoare triple {22063#(and (or (= ULTIMATE.start_main_~q~0 (* 2 (* ULTIMATE.start_main_~p~0 (div (div (* ULTIMATE.start_main_~y~0 (- 1)) 2) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))) (= (div (* ULTIMATE.start_main_~y~0 (- 1)) 2) 0)) (= ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~y~0 (* 2 (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~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; {22067#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:29:48,840 INFO L281 TraceCheckUtils]: 44: Hoare triple {22067#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {21919#false} is VALID [2021-09-13 14:29:48,840 INFO L281 TraceCheckUtils]: 45: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2021-09-13 14:29:48,841 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:29:48,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:30:32,364 INFO L281 TraceCheckUtils]: 45: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2021-09-13 14:30:32,364 INFO L281 TraceCheckUtils]: 44: Hoare triple {22067#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {21919#false} is VALID [2021-09-13 14:30:32,365 INFO L281 TraceCheckUtils]: 43: Hoare triple {22080#(= (+ (* 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; {22067#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:30:32,365 INFO L281 TraceCheckUtils]: 42: Hoare triple {22084#(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); {22080#(= (+ (* 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:30:32,366 INFO L281 TraceCheckUtils]: 41: Hoare triple {22084#(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; {22084#(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:30:32,530 INFO L281 TraceCheckUtils]: 40: Hoare triple {22091#(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; {22084#(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:30:32,530 INFO L281 TraceCheckUtils]: 39: Hoare triple {22091#(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); {22091#(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:30:32,531 INFO L281 TraceCheckUtils]: 38: Hoare triple {22091#(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; {22091#(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:30:32,572 INFO L281 TraceCheckUtils]: 37: Hoare triple {22101#(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; {22091#(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:30:32,572 INFO L281 TraceCheckUtils]: 36: Hoare triple {22101#(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); {22101#(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:30:32,573 INFO L281 TraceCheckUtils]: 35: Hoare triple {22108#(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); {22101#(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:30:32,573 INFO L281 TraceCheckUtils]: 34: Hoare triple {22112#(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; {22108#(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:30:32,574 INFO L281 TraceCheckUtils]: 33: Hoare triple {22112#(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); {22112#(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:30:32,574 INFO L281 TraceCheckUtils]: 32: Hoare triple {22112#(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; {22112#(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:30:32,575 INFO L281 TraceCheckUtils]: 31: Hoare triple {22122#(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); {22112#(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:30:32,576 INFO L281 TraceCheckUtils]: 30: Hoare triple {22126#(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; {22122#(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:30:32,576 INFO L281 TraceCheckUtils]: 29: Hoare triple {22130#(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)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {22126#(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:30:32,577 INFO L281 TraceCheckUtils]: 28: Hoare triple {22134#(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)) (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; {22130#(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)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:30:34,580 INFO L281 TraceCheckUtils]: 27: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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; {22134#(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)) (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 UNKNOWN [2021-09-13 14:30:34,581 INFO L281 TraceCheckUtils]: 26: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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); {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,581 INFO L281 TraceCheckUtils]: 25: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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; {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,581 INFO L281 TraceCheckUtils]: 24: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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); {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,582 INFO L281 TraceCheckUtils]: 23: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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; {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,582 INFO L281 TraceCheckUtils]: 22: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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); {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,582 INFO L281 TraceCheckUtils]: 21: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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; {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,582 INFO L281 TraceCheckUtils]: 20: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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); {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,583 INFO L281 TraceCheckUtils]: 19: Hoare triple {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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; {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,669 INFO L281 TraceCheckUtils]: 18: Hoare triple {22166#(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)) (and (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~x~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~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_~b~0 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; {22138#(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)) (and (or (= ULTIMATE.start_main_~b~0 0) (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~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_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (not (= (mod ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) 0))) (or (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~v~0 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:30:34,669 INFO L281 TraceCheckUtils]: 17: Hoare triple {22166#(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)) (and (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~x~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~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_~b~0 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; {22166#(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)) (and (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~x~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~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_~b~0 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:30:34,671 INFO L281 TraceCheckUtils]: 16: Hoare triple {22173#(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)) (not (= ULTIMATE.start_main_~a~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~b~0 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; {22166#(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)) (and (= (+ (* 2 (* ULTIMATE.start_main_~q~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~x~0)) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~s~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~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_~b~0 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:30:34,671 INFO L281 TraceCheckUtils]: 15: Hoare triple {22173#(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)) (not (= ULTIMATE.start_main_~a~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~b~0 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; {22173#(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)) (not (= ULTIMATE.start_main_~a~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~b~0 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:30:36,674 INFO L281 TraceCheckUtils]: 14: Hoare triple {22180#(or (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) 0)) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= (+ 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) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) ULTIMATE.start_main_~x~0))))) (or (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (+ (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= ULTIMATE.start_main_~x~0 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; {22173#(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)) (not (= ULTIMATE.start_main_~a~0 (* 2 ULTIMATE.start_main_~b~0))) (not (= ULTIMATE.start_main_~b~0 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 UNKNOWN [2021-09-13 14:30:36,675 INFO L281 TraceCheckUtils]: 13: Hoare triple {22180#(or (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) 0)) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= (+ 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) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) ULTIMATE.start_main_~x~0))))) (or (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (+ (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= ULTIMATE.start_main_~x~0 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); {22180#(or (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) 0)) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= (+ 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) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) ULTIMATE.start_main_~x~0))))) (or (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (+ (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= ULTIMATE.start_main_~x~0 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:30:36,675 INFO L281 TraceCheckUtils]: 12: Hoare triple {22180#(or (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) 0)) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= (+ 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) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) ULTIMATE.start_main_~x~0))))) (or (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (+ (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= ULTIMATE.start_main_~x~0 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; {22180#(or (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) 0)) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= (+ 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) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) ULTIMATE.start_main_~x~0))))) (or (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (+ (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= ULTIMATE.start_main_~x~0 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:30:36,677 INFO L281 TraceCheckUtils]: 11: Hoare triple {22190#(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)) (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))) 0)) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) ULTIMATE.start_main_~x~0) 0)) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))))) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0))) (or (not (= ULTIMATE.start_main_~x~0 0)) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0)) (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2))))))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {22180#(or (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) 0)) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= (+ 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) (* (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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_~x~0) ULTIMATE.start_main_~x~0))))) (or (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (+ (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* 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 (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) 2) 0)) (not (= ULTIMATE.start_main_~x~0 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:30:36,677 INFO L281 TraceCheckUtils]: 10: Hoare triple {22190#(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)) (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))) 0)) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) ULTIMATE.start_main_~x~0) 0)) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))))) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0))) (or (not (= ULTIMATE.start_main_~x~0 0)) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0)) (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2))))))} assume !false; {22190#(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)) (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))) 0)) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) ULTIMATE.start_main_~x~0) 0)) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))))) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0))) (or (not (= ULTIMATE.start_main_~x~0 0)) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0)) (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2))))))} is VALID [2021-09-13 14:30:36,679 INFO L281 TraceCheckUtils]: 9: Hoare triple {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 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; {22190#(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)) (and (or (= ULTIMATE.start_main_~x~0 0) (not (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))) 0)) (not (= (mod (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) ULTIMATE.start_main_~x~0) 0)) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~x~0 (div (+ (* (- 1) ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2)) ULTIMATE.start_main_~x~0))))) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0))) (or (not (= ULTIMATE.start_main_~x~0 0)) (not (= (mod (+ (* 2 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 0) (* (- 2) ULTIMATE.start_main_~r~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) (* 2 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 0)) 2) 0)) (not (= (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (div (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 2))))))} is VALID [2021-09-13 14:30:36,679 INFO L281 TraceCheckUtils]: 8: Hoare triple {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} assume !(0 == assume_abort_if_not_~cond); {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} is VALID [2021-09-13 14:30:36,679 INFO L281 TraceCheckUtils]: 7: Hoare triple {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 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; {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} is VALID [2021-09-13 14:30:36,679 INFO L281 TraceCheckUtils]: 6: Hoare triple {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} assume !(0 == assume_abort_if_not_~cond); {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} is VALID [2021-09-13 14:30:36,680 INFO L281 TraceCheckUtils]: 5: Hoare triple {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 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; {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} is VALID [2021-09-13 14:30:36,680 INFO L281 TraceCheckUtils]: 4: Hoare triple {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} assume !(0 == assume_abort_if_not_~cond); {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} is VALID [2021-09-13 14:30:36,680 INFO L281 TraceCheckUtils]: 3: Hoare triple {22216#(not (= ULTIMATE.start_main_~x~0 0))} 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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {22197#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (not (= ULTIMATE.start_main_~x~0 0)) (not (= (div ULTIMATE.start_main_~y~0 2) 0)))} is VALID [2021-09-13 14:30:36,681 INFO L281 TraceCheckUtils]: 2: Hoare triple {22216#(not (= ULTIMATE.start_main_~x~0 0))} assume !(0 == assume_abort_if_not_~cond); {22216#(not (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:30:36,681 INFO L281 TraceCheckUtils]: 1: Hoare triple {21919#false} 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 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {22216#(not (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:30:36,687 INFO L281 TraceCheckUtils]: 0: Hoare triple {21918#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); {21919#false} is INVALID [2021-09-13 14:30:36,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:30:36,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220718736] [2021-09-13 14:30:36,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:30:36,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271002947] [2021-09-13 14:30:36,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: invalid Hoare triple in BP [2021-09-13 14:30:36,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:30:36,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-09-13 14:30:36,688 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-09-13 14:30:36,688 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-09-13 14:30:36,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-09-13 14:30:36,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-09-13 14:30:36,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-09-13 14:30:36,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-09-13 14:30:36,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-09-13 14:30:36,713 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:30:36,905 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:30:36,913 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:30:36,940 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:30:36,940 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:30:36,940 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:30:36,940 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:30:36,940 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:30:36,940 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:30:36,940 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:30:36,941 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2021-09-13 14:30:36,941 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:30:36,941 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:30:36,941 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2021-09-13 14:30:36,941 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:30:36,941 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:30:36,942 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L11-14 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2021-09-13 14:30:36,943 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:30:36,944 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:30:36,945 WARN L170 areAnnotationChecker]: L11-8 has no Hoare annotation [2021-09-13 14:30:36,946 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:30:36,946 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:30:36,946 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:30:36,946 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:30:36,946 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:30:36,946 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:30:36,946 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:30:36,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:30:36 BoogieIcfgContainer [2021-09-13 14:30:36,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:30:36,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:30:36,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:30:36,948 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:30:36,949 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:59" (3/4) ... [2021-09-13 14:30:36,951 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-09-13 14:30:36,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:30:36,952 INFO L158 Benchmark]: Toolchain (without parser) took 218249.48ms. Allocated memory was 52.4MB in the beginning and 220.2MB in the end (delta: 167.8MB). Free memory was 28.9MB in the beginning and 175.5MB in the end (delta: -146.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2021-09-13 14:30:36,953 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:30:36,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.49ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 28.6MB in the beginning and 51.4MB in the end (delta: -22.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2021-09-13 14:30:36,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.86ms. Allocated memory is still 69.2MB. Free memory was 51.2MB in the beginning and 49.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:30:36,954 INFO L158 Benchmark]: Boogie Preprocessor took 41.11ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 48.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:30:36,954 INFO L158 Benchmark]: RCFGBuilder took 384.92ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 36.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:30:36,955 INFO L158 Benchmark]: TraceAbstraction took 217378.90ms. Allocated memory was 69.2MB in the beginning and 220.2MB in the end (delta: 151.0MB). Free memory was 36.3MB in the beginning and 176.6MB in the end (delta: -140.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2021-09-13 14:30:36,955 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 220.2MB. Free memory was 176.6MB in the beginning and 175.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:30:36,956 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.13ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.49ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 28.6MB in the beginning and 51.4MB in the end (delta: -22.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.86ms. Allocated memory is still 69.2MB. Free memory was 51.2MB in the beginning and 49.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.11ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 48.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.92ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 36.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 217378.90ms. Allocated memory was 69.2MB in the beginning and 220.2MB in the end (delta: 151.0MB). Free memory was 36.3MB in the beginning and 176.6MB in the end (delta: -140.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 220.2MB. Free memory was 176.6MB in the beginning and 175.5MB 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 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 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 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: 217252.89ms, OverallIterations: 16, TraceHistogramMax: 4, EmptinessCheckTime: 22.99ms, AutomataDifference: 94145.65ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 8.77ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2754 SdHoareTripleChecker+Valid, 18927.12ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2754 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 18849.92ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2274 mSDsCounter, 706 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4880 IncrementalHoareTripleChecker+Invalid, 5587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 706 mSolverCounterUnsat, 0 mSDtfsCounter, 4880 mSolverCounterSat, 62.14ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 464 SyntacticMatches, 7 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2967 ImplicationChecksByTransitivity, 20866.96ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=13, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 14873.49ms AutomataMinimizationTime, 15 MinimizatonAttempts, 975 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 81.34ms SsaConstructionTime, 244.49ms SatisfiabilityAnalysisTime, 15462.71ms InterpolantComputationTime, 395 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 583 ConstructedInterpolants, 0 QuantifiedInterpolants, 5492 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1655 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 77/160 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:30:37,069 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:30:38,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:30:38,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:30:38,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:30:38,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:30:38,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:30:38,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:30:38,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:30:38,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:30:38,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:30:38,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:30:38,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:30:38,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:30:38,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:30:38,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:30:38,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:30:38,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:30:38,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:30:38,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:30:38,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:30:38,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:30:38,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:30:38,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:30:38,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:30:38,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:30:38,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:30:38,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:30:38,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:30:38,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:30:38,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:30:38,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:30:38,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:30:38,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:30:38,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:30:38,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:30:38,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:30:38,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:30:38,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:30:38,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:30:38,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:30:38,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:30:38,865 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:30:38,884 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:30:38,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:30:38,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:30:38,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:30:38,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:30:38,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:30:38,886 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:30:38,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:30:38,887 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:30:38,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:30:38,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:30:38,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:30:38,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:30:38,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:30:38,888 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:30:38,888 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:30:38,888 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:30:38,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:30:38,889 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:30:38,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:30:38,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:30:38,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:30:38,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:30:38,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:30:38,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:30:38,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:30:38,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:30:38,890 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:30:38,890 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:30:38,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:30:38,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:30:38,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:30:38,891 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 -> 51f02f4bbf4fcef8f26c70f6c839d08aece336aa [2021-09-13 14:30:39,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:30:39,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:30:39,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:30:39,222 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:30:39,224 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:30:39,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound50.c [2021-09-13 14:30:39,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c9fa43b/ba0fe1793a6b4e3795b52b033f2e4cf7/FLAG33080f0d2 [2021-09-13 14:30:39,800 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:30:39,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_valuebound50.c [2021-09-13 14:30:39,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c9fa43b/ba0fe1793a6b4e3795b52b033f2e4cf7/FLAG33080f0d2 [2021-09-13 14:30:40,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c9fa43b/ba0fe1793a6b4e3795b52b033f2e4cf7 [2021-09-13 14:30:40,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:30:40,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:30:40,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:30:40,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:30:40,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:30:40,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62429577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40, skipping insertion in model container [2021-09-13 14:30:40,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:30:40,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:30:40,408 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_valuebound50.c[490,503] [2021-09-13 14:30:40,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:30:40,439 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:30:40,450 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_valuebound50.c[490,503] [2021-09-13 14:30:40,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:30:40,475 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:30:40,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40 WrapperNode [2021-09-13 14:30:40,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:30:40,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:30:40,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:30:40,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:30:40,483 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:30:40" (1/1) ... [2021-09-13 14:30:40,490 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:30:40" (1/1) ... [2021-09-13 14:30:40,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:30:40,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:30:40,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:30:40,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:30:40,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:30:40,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:30:40,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:30:40,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:30:40,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (1/1) ... [2021-09-13 14:30:40,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:30:40,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:30:40,626 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:30:40,646 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:30:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:30:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:30:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:30:40,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:30:44,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:30:44,986 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-09-13 14:30:44,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:30:44 BoogieIcfgContainer [2021-09-13 14:30:44,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:30:44,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:30:44,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:30:44,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:30:44,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:30:40" (1/3) ... [2021-09-13 14:30:44,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147da11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:30:44, skipping insertion in model container [2021-09-13 14:30:44,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:30:40" (2/3) ... [2021-09-13 14:30:44,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147da11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:30:44, skipping insertion in model container [2021-09-13 14:30:44,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:30:44" (3/3) ... [2021-09-13 14:30:44,994 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound50.c [2021-09-13 14:30:44,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:30:44,998 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:30:45,037 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:30:45,043 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:30:45,043 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:30:45,080 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:30:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:30:45,084 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:30:45,085 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:30:45,085 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:30:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:30:45,089 INFO L82 PathProgramCache]: Analyzing trace with hash -174497841, now seen corresponding path program 1 times [2021-09-13 14:30:45,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:30:45,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626047060] [2021-09-13 14:30:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:30:45,104 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:30:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:30:45,106 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:30:45,108 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:30:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:45,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:30:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:45,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:30:45,424 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:30:45,424 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, 50bv32) 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:30:45,441 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:30:45,441 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, 50bv32) 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:30:45,441 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:30:45,442 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:30:45,442 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:30:45,442 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:30:45,442 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:30:45,443 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:30:45,443 INFO L281 TraceCheckUtils]: 10: Hoare triple {45#false} assume false; {45#false} is VALID [2021-09-13 14:30:45,443 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:30:45,443 INFO L281 TraceCheckUtils]: 12: Hoare triple {45#false} assume 0bv32 == __VERIFIER_assert_~cond; {45#false} is VALID [2021-09-13 14:30:45,444 INFO L281 TraceCheckUtils]: 13: Hoare triple {45#false} assume !false; {45#false} is VALID [2021-09-13 14:30:45,445 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:30:45,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:30:45,516 INFO L281 TraceCheckUtils]: 13: Hoare triple {45#false} assume !false; {45#false} is VALID [2021-09-13 14:30:45,516 INFO L281 TraceCheckUtils]: 12: Hoare triple {45#false} assume 0bv32 == __VERIFIER_assert_~cond; {45#false} is VALID [2021-09-13 14:30:45,517 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:30:45,517 INFO L281 TraceCheckUtils]: 10: Hoare triple {45#false} assume false; {45#false} is VALID [2021-09-13 14:30:45,517 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:30:45,517 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:30:45,517 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:30:45,518 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:30:45,518 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:30:45,518 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:30:45,518 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, 50bv32) 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:30:45,519 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:30:45,519 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, 50bv32) 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:30:45,519 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:30:45,519 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:30:45,520 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:30:45,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626047060] [2021-09-13 14:30:45,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626047060] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:30:45,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:30:45,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:30:45,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994070161] [2021-09-13 14:30:45,528 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:30:45,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:30:45,531 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:30:45,676 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:30:45,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:30:45,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:30:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:30:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:30:45,704 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:30:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:48,568 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2021-09-13 14:30:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:30:48,569 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:30:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:30:48,571 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:30:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:30:48,585 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:30:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:30:48,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:30:49,205 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:30:49,213 INFO L225 Difference]: With dead ends: 79 [2021-09-13 14:30:49,213 INFO L226 Difference]: Without dead ends: 37 [2021-09-13 14:30:49,216 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.21ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:30:49,219 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1365.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.17ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1367.88ms IncrementalHoareTripleChecker+Time [2021-09-13 14:30:49,220 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 1.17ms Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1367.88ms Time] [2021-09-13 14:30:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-09-13 14:30:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-09-13 14:30:49,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:30:49,254 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:30:49,255 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:30:49,255 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:30:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:49,259 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:30:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:30:49,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:49,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:49,260 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:30:49,261 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:30:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:49,263 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:30:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:30:49,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:49,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:49,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:30:49,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:30:49,265 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:30:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-09-13 14:30:49,268 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 14 [2021-09-13 14:30:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:30:49,268 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-09-13 14:30:49,269 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:30:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:30:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:30:49,269 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:30:49,270 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:30:49,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:30:49,470 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:30:49,471 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:30:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:30:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1454170515, now seen corresponding path program 1 times [2021-09-13 14:30:49,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:30:49,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344970334] [2021-09-13 14:30:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:30:49,473 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:30:49,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:30:49,474 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:30:49,501 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:30:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:49,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 14:30:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:49,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:30:50,364 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:30:50,364 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, 50bv32) 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:30:50,365 INFO L281 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:30:50,366 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {355#(or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} is VALID [2021-09-13 14:30:50,367 INFO L281 TraceCheckUtils]: 4: Hoare triple {355#(or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {359#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:30:50,367 INFO L281 TraceCheckUtils]: 5: Hoare triple {359#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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 (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:30:50,369 INFO L281 TraceCheckUtils]: 6: Hoare triple {359#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {359#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:30:50,370 INFO L281 TraceCheckUtils]: 7: Hoare triple {359#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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 (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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:30:50,370 INFO L281 TraceCheckUtils]: 8: Hoare triple {369#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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 (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:30:50,372 INFO L281 TraceCheckUtils]: 9: Hoare triple {373#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} is VALID [2021-09-13 14:30:50,377 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) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} is VALID [2021-09-13 14:30:50,378 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) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {342#false} is VALID [2021-09-13 14:30:50,378 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:30:50,379 INFO L281 TraceCheckUtils]: 13: Hoare triple {342#false} assume 0bv32 == __VERIFIER_assert_~cond; {342#false} is VALID [2021-09-13 14:30:50,379 INFO L281 TraceCheckUtils]: 14: Hoare triple {342#false} assume !false; {342#false} is VALID [2021-09-13 14:30:50,380 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:30:50,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:30:50,663 INFO L281 TraceCheckUtils]: 14: Hoare triple {342#false} assume !false; {342#false} is VALID [2021-09-13 14:30:50,664 INFO L281 TraceCheckUtils]: 13: Hoare triple {342#false} assume 0bv32 == __VERIFIER_assert_~cond; {342#false} is VALID [2021-09-13 14:30:50,665 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:30:50,666 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:30:50,667 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:30:50,671 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:30:50,672 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:30:50,674 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:30:50,674 INFO L281 TraceCheckUtils]: 6: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:30:50,674 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:30:50,674 INFO L281 TraceCheckUtils]: 4: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:30:50,674 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, 50bv32) 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:30:50,674 INFO L281 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(0bv32 == assume_abort_if_not_~cond); {341#true} is VALID [2021-09-13 14:30:50,675 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, 50bv32) 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:30:50,675 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:30:50,675 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:30:50,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:30:50,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344970334] [2021-09-13 14:30:50,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344970334] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:30:50,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:30:50,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2021-09-13 14:30:50,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67014710] [2021-09-13 14:30:50,678 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:30:50,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:30:50,679 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:30:50,834 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:30:50,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:30:50,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:30:50,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:30:50,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:30:50,835 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:31:02,927 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:31:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:09,641 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2021-09-13 14:31:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:31:09,642 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:31:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:31:09,642 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:31:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2021-09-13 14:31:09,644 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:31:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2021-09-13 14:31:09,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2021-09-13 14:31:10,038 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:31:10,039 INFO L225 Difference]: With dead ends: 43 [2021-09-13 14:31:10,039 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:31:10,040 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 734.97ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:31:10,041 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8786.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.44ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 8794.46ms IncrementalHoareTripleChecker+Time [2021-09-13 14:31:10,042 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 5.44ms Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 38 Unchecked, 8794.46ms Time] [2021-09-13 14:31:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:31:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:31:10,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:31:10,053 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:31:10,054 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:31:10,054 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:31:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:10,056 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-09-13 14:31:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:31:10,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:10,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:10,057 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:31:10,058 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:31:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:10,060 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-09-13 14:31:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:31:10,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:10,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:10,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:31:10,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:31:10,061 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:31:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-09-13 14:31:10,063 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 15 [2021-09-13 14:31:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:31:10,063 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-09-13 14:31:10,063 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:31:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-09-13 14:31:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:31:10,064 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:31:10,064 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:31:10,081 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:31:10,278 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:31:10,279 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:31:10,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:31:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1580206288, now seen corresponding path program 1 times [2021-09-13 14:31:10,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:31:10,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127699753] [2021-09-13 14:31:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:10,283 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:31:10,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:31:10,285 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:31:10,286 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:31:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:10,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:31:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:10,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:31:11,780 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:31:11,781 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {627#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:31:11,782 INFO L281 TraceCheckUtils]: 2: Hoare triple {627#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {631#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:31:11,785 INFO L281 TraceCheckUtils]: 3: Hoare triple {631#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {635#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} is VALID [2021-09-13 14:31:11,786 INFO L281 TraceCheckUtils]: 4: Hoare triple {635#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:31:11,787 INFO L281 TraceCheckUtils]: 5: Hoare triple {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:31:11,787 INFO L281 TraceCheckUtils]: 6: Hoare triple {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:31:11,787 INFO L281 TraceCheckUtils]: 7: Hoare triple {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:31:11,788 INFO L281 TraceCheckUtils]: 8: Hoare triple {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:31:11,789 INFO L281 TraceCheckUtils]: 9: Hoare triple {639#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:31:11,789 INFO L281 TraceCheckUtils]: 10: Hoare triple {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !false; {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:31:11,790 INFO L281 TraceCheckUtils]: 11: Hoare triple {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~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); {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:31:11,790 INFO L281 TraceCheckUtils]: 12: Hoare triple {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !false; {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:31:11,791 INFO L281 TraceCheckUtils]: 13: Hoare triple {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~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; {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:31:11,792 INFO L281 TraceCheckUtils]: 14: Hoare triple {655#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~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; {671#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:31:11,792 INFO L281 TraceCheckUtils]: 15: Hoare triple {671#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {620#false} is VALID [2021-09-13 14:31:11,792 INFO L281 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2021-09-13 14:31:11,793 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:31:11,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:31:20,207 INFO L281 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2021-09-13 14:31:20,208 INFO L281 TraceCheckUtils]: 15: Hoare triple {681#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {620#false} is VALID [2021-09-13 14:31:20,209 INFO L281 TraceCheckUtils]: 14: Hoare triple {685#(= (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; {681#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:31:20,209 INFO L281 TraceCheckUtils]: 13: Hoare triple {685#(= (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; {685#(= (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:31:20,210 INFO L281 TraceCheckUtils]: 12: Hoare triple {685#(= (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; {685#(= (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:31:20,210 INFO L281 TraceCheckUtils]: 11: Hoare triple {685#(= (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); {685#(= (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:31:20,211 INFO L281 TraceCheckUtils]: 10: Hoare triple {685#(= (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; {685#(= (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:31:20,211 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); {685#(= (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:31:20,212 INFO L281 TraceCheckUtils]: 8: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:31:20,212 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:31:20,212 INFO L281 TraceCheckUtils]: 6: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:31:20,212 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:31:20,212 INFO L281 TraceCheckUtils]: 4: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:31:20,213 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, 50bv32) 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:31:20,213 INFO L281 TraceCheckUtils]: 2: Hoare triple {619#true} assume !(0bv32 == assume_abort_if_not_~cond); {619#true} is VALID [2021-09-13 14:31:20,213 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, 50bv32) 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:31:20,213 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:31:20,213 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:31:20,214 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:31:20,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127699753] [2021-09-13 14:31:20,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127699753] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:31:20,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:31:20,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:31:20,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619841269] [2021-09-13 14:31:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:31:20,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:20,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:31:20,603 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:31:20,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:31:20,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:31:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:31:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:31:20,604 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:32:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:02,326 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2021-09-13 14:32:02,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:32:02,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:32:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:32:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2021-09-13 14:32:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:32:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2021-09-13 14:32:02,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2021-09-13 14:32:03,430 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:32:03,432 INFO L225 Difference]: With dead ends: 71 [2021-09-13 14:32:03,432 INFO L226 Difference]: Without dead ends: 69 [2021-09-13 14:32:03,433 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4862.12ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:32:03,434 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15971.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.75ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15977.77ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:03,434 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 5.75ms Time], IncrementalHoareTripleChecker [18 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 15977.77ms Time] [2021-09-13 14:32:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-09-13 14:32:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2021-09-13 14:32:03,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:03,473 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:32:03,474 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:32:03,474 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:32:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:03,477 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-09-13 14:32:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-09-13 14:32:03,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:03,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:03,478 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:32:03,478 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:32:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:03,481 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-09-13 14:32:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-09-13 14:32:03,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:03,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:03,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:03,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:03,483 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:32:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2021-09-13 14:32:03,484 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2021-09-13 14:32:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:03,485 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2021-09-13 14:32:03,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:32:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2021-09-13 14:32:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:32:03,486 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:03,486 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:32:03,510 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:32:03,698 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:32:03,700 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:32:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:03,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1840022701, now seen corresponding path program 1 times [2021-09-13 14:32:03,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:32:03,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290399917] [2021-09-13 14:32:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:03,701 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:32:03,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:32:03,702 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:32:03,704 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:32:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:03,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:32:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:03,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:05,138 INFO L281 TraceCheckUtils]: 0: Hoare triple {1030#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); {1030#true} is VALID [2021-09-13 14:32:05,139 INFO L281 TraceCheckUtils]: 1: Hoare triple {1030#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1038#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:32:05,141 INFO L281 TraceCheckUtils]: 2: Hoare triple {1038#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1042#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,142 INFO L281 TraceCheckUtils]: 3: Hoare triple {1042#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1046#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} is VALID [2021-09-13 14:32:05,143 INFO L281 TraceCheckUtils]: 4: Hoare triple {1046#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,145 INFO L281 TraceCheckUtils]: 5: Hoare triple {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,145 INFO L281 TraceCheckUtils]: 6: Hoare triple {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,146 INFO L281 TraceCheckUtils]: 7: Hoare triple {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,146 INFO L281 TraceCheckUtils]: 8: Hoare triple {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,147 INFO L281 TraceCheckUtils]: 9: Hoare triple {1050#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,147 INFO L281 TraceCheckUtils]: 10: Hoare triple {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !false; {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,150 INFO L281 TraceCheckUtils]: 11: Hoare triple {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,150 INFO L281 TraceCheckUtils]: 12: Hoare triple {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !false; {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,151 INFO L281 TraceCheckUtils]: 13: Hoare triple {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,152 INFO L281 TraceCheckUtils]: 14: Hoare triple {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,152 INFO L281 TraceCheckUtils]: 15: Hoare triple {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:05,153 INFO L281 TraceCheckUtils]: 16: Hoare triple {1066#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {1088#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:32:05,154 INFO L281 TraceCheckUtils]: 17: Hoare triple {1088#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1031#false} is VALID [2021-09-13 14:32:05,154 INFO L281 TraceCheckUtils]: 18: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2021-09-13 14:32:05,154 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:32:05,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:14,976 INFO L281 TraceCheckUtils]: 18: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2021-09-13 14:32:14,977 INFO L281 TraceCheckUtils]: 17: Hoare triple {1098#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1031#false} is VALID [2021-09-13 14:32:14,978 INFO L281 TraceCheckUtils]: 16: Hoare triple {1102#(= (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; {1098#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:32:14,978 INFO L281 TraceCheckUtils]: 15: Hoare triple {1102#(= (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); {1102#(= (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:32:14,979 INFO L281 TraceCheckUtils]: 14: Hoare triple {1102#(= (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; {1102#(= (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:32:14,979 INFO L281 TraceCheckUtils]: 13: Hoare triple {1102#(= (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; {1102#(= (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:32:14,980 INFO L281 TraceCheckUtils]: 12: Hoare triple {1102#(= (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; {1102#(= (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:32:14,980 INFO L281 TraceCheckUtils]: 11: Hoare triple {1102#(= (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); {1102#(= (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:32:14,980 INFO L281 TraceCheckUtils]: 10: Hoare triple {1102#(= (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; {1102#(= (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:32:14,981 INFO L281 TraceCheckUtils]: 9: Hoare triple {1030#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); {1102#(= (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:32:14,981 INFO L281 TraceCheckUtils]: 8: Hoare triple {1030#true} assume !(0bv32 == assume_abort_if_not_~cond); {1030#true} is VALID [2021-09-13 14:32:14,981 INFO L281 TraceCheckUtils]: 7: Hoare triple {1030#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; {1030#true} is VALID [2021-09-13 14:32:14,981 INFO L281 TraceCheckUtils]: 6: Hoare triple {1030#true} assume !(0bv32 == assume_abort_if_not_~cond); {1030#true} is VALID [2021-09-13 14:32:14,981 INFO L281 TraceCheckUtils]: 5: Hoare triple {1030#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; {1030#true} is VALID [2021-09-13 14:32:14,981 INFO L281 TraceCheckUtils]: 4: Hoare triple {1030#true} assume !(0bv32 == assume_abort_if_not_~cond); {1030#true} is VALID [2021-09-13 14:32:14,982 INFO L281 TraceCheckUtils]: 3: Hoare triple {1030#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1030#true} is VALID [2021-09-13 14:32:14,982 INFO L281 TraceCheckUtils]: 2: Hoare triple {1030#true} assume !(0bv32 == assume_abort_if_not_~cond); {1030#true} is VALID [2021-09-13 14:32:14,982 INFO L281 TraceCheckUtils]: 1: Hoare triple {1030#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1030#true} is VALID [2021-09-13 14:32:14,982 INFO L281 TraceCheckUtils]: 0: Hoare triple {1030#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); {1030#true} is VALID [2021-09-13 14:32:14,982 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:32:14,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:32:14,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290399917] [2021-09-13 14:32:14,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290399917] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:32:14,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:32:14,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:32:14,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654966779] [2021-09-13 14:32:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:32:14,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:14,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:32:15,629 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:32:15,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:32:15,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:32:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:32:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:32:15,631 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:32:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:54,942 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-09-13 14:32:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:32:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:32:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:32:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2021-09-13 14:32:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:32:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2021-09-13 14:32:54,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2021-09-13 14:32:55,987 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:32:55,989 INFO L225 Difference]: With dead ends: 69 [2021-09-13 14:32:55,989 INFO L226 Difference]: Without dead ends: 67 [2021-09-13 14:32:55,990 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 5061.42ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:32:55,991 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15776.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.69ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15783.18ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:55,991 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 302 Unknown, 0 Unchecked, 4.69ms Time], IncrementalHoareTripleChecker [15 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 15783.18ms Time] [2021-09-13 14:32:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-09-13 14:32:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2021-09-13 14:32:56,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:56,024 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:32:56,025 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:32:56,025 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:32:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:56,027 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-09-13 14:32:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-09-13 14:32:56,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:56,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:56,028 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:32:56,028 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:32:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:56,030 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-09-13 14:32:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-09-13 14:32:56,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:56,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:56,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:56,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:56,031 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:32:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-09-13 14:32:56,033 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 19 [2021-09-13 14:32:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:56,033 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-09-13 14:32:56,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:32:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-09-13 14:32:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:32:56,034 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:56,034 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:32:56,061 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:32:56,247 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:32:56,249 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:32:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1412177226, now seen corresponding path program 1 times [2021-09-13 14:32:56,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:32:56,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669484823] [2021-09-13 14:32:56,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:56,251 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:32:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:32:56,251 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:32:56,252 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:32:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:56,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:32:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:56,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:57,029 INFO L281 TraceCheckUtils]: 0: Hoare triple {1447#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); {1447#true} is VALID [2021-09-13 14:32:57,030 INFO L281 TraceCheckUtils]: 1: Hoare triple {1447#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1455#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:32:57,030 INFO L281 TraceCheckUtils]: 2: Hoare triple {1455#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1459#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:57,031 INFO L281 TraceCheckUtils]: 3: Hoare triple {1459#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1459#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:57,031 INFO L281 TraceCheckUtils]: 4: Hoare triple {1459#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1459#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:32:57,032 INFO L281 TraceCheckUtils]: 5: Hoare triple {1459#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 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; {1469#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (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))))))} is VALID [2021-09-13 14:32:57,032 INFO L281 TraceCheckUtils]: 6: Hoare triple {1469#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (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))))))} assume !(0bv32 == assume_abort_if_not_~cond); {1473#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:57,032 INFO L281 TraceCheckUtils]: 7: Hoare triple {1473#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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; {1473#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:57,033 INFO L281 TraceCheckUtils]: 8: Hoare triple {1473#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1473#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:57,034 INFO L281 TraceCheckUtils]: 9: Hoare triple {1473#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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); {1483#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:32:57,034 INFO L281 TraceCheckUtils]: 10: Hoare triple {1483#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0)))} assume !false; {1483#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0)))} is VALID [2021-09-13 14:32:57,035 INFO L281 TraceCheckUtils]: 11: Hoare triple {1483#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ 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); {1490#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:32:57,035 INFO L281 TraceCheckUtils]: 12: Hoare triple {1490#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0)))} assume !false; {1490#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:32:57,036 INFO L281 TraceCheckUtils]: 13: Hoare triple {1490#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0)))} assume !~bvsge64(main_~c~0, main_~b~0); {1490#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:32:57,036 INFO L281 TraceCheckUtils]: 14: Hoare triple {1490#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~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 := ~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)); {1500#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0)))} is VALID [2021-09-13 14:32:57,037 INFO L281 TraceCheckUtils]: 15: Hoare triple {1500#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0)))} assume !false; {1500#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0)))} is VALID [2021-09-13 14:32:57,037 INFO L281 TraceCheckUtils]: 16: Hoare triple {1500#(exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0)))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {1448#false} is VALID [2021-09-13 14:32:57,037 INFO L281 TraceCheckUtils]: 17: Hoare triple {1448#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; {1448#false} is VALID [2021-09-13 14:32:57,038 INFO L281 TraceCheckUtils]: 18: Hoare triple {1448#false} assume 0bv32 == __VERIFIER_assert_~cond; {1448#false} is VALID [2021-09-13 14:32:57,038 INFO L281 TraceCheckUtils]: 19: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2021-09-13 14:32:57,038 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:32:57,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:57,472 INFO L281 TraceCheckUtils]: 19: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2021-09-13 14:32:57,472 INFO L281 TraceCheckUtils]: 18: Hoare triple {1448#false} assume 0bv32 == __VERIFIER_assert_~cond; {1448#false} is VALID [2021-09-13 14:32:57,472 INFO L281 TraceCheckUtils]: 17: Hoare triple {1448#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; {1448#false} is VALID [2021-09-13 14:32:57,473 INFO L281 TraceCheckUtils]: 16: Hoare triple {1525#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {1448#false} is VALID [2021-09-13 14:32:57,473 INFO L281 TraceCheckUtils]: 15: Hoare triple {1525#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !false; {1525#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:32:57,474 INFO L281 TraceCheckUtils]: 14: Hoare triple {1532#(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)); {1525#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:32:57,474 INFO L281 TraceCheckUtils]: 13: Hoare triple {1532#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !~bvsge64(main_~c~0, main_~b~0); {1532#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:57,474 INFO L281 TraceCheckUtils]: 12: Hoare triple {1532#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !false; {1532#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:57,475 INFO L281 TraceCheckUtils]: 11: Hoare triple {1542#(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); {1532#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:57,475 INFO L281 TraceCheckUtils]: 10: Hoare triple {1542#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} assume !false; {1542#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:57,476 INFO L281 TraceCheckUtils]: 9: Hoare triple {1549#(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); {1542#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:57,477 INFO L281 TraceCheckUtils]: 8: Hoare triple {1549#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {1549#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:57,477 INFO L281 TraceCheckUtils]: 7: Hoare triple {1549#(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; {1549#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:57,478 INFO L281 TraceCheckUtils]: 6: Hoare triple {1559#(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); {1549#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:32:57,478 INFO L281 TraceCheckUtils]: 5: Hoare triple {1447#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; {1559#(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:32:57,478 INFO L281 TraceCheckUtils]: 4: Hoare triple {1447#true} assume !(0bv32 == assume_abort_if_not_~cond); {1447#true} is VALID [2021-09-13 14:32:57,478 INFO L281 TraceCheckUtils]: 3: Hoare triple {1447#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1447#true} is VALID [2021-09-13 14:32:57,478 INFO L281 TraceCheckUtils]: 2: Hoare triple {1447#true} assume !(0bv32 == assume_abort_if_not_~cond); {1447#true} is VALID [2021-09-13 14:32:57,479 INFO L281 TraceCheckUtils]: 1: Hoare triple {1447#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1447#true} is VALID [2021-09-13 14:32:57,479 INFO L281 TraceCheckUtils]: 0: Hoare triple {1447#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); {1447#true} is VALID [2021-09-13 14:32:57,479 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:32:57,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:32:57,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669484823] [2021-09-13 14:32:57,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669484823] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:32:57,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:32:57,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2021-09-13 14:32:57,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541990580] [2021-09-13 14:32:57,480 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:32:57,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:57,480 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:32:57,770 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:32:57,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:32:57,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:32:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:32:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:32:57,771 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:33:12,849 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:33:20,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:33:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:20,782 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-09-13 14:33:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:33:20,783 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:33:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:33:20,783 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:33:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2021-09-13 14:33:20,784 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:33:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2021-09-13 14:33:20,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2021-09-13 14:33:21,325 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:33:21,326 INFO L225 Difference]: With dead ends: 60 [2021-09-13 14:33:21,326 INFO L226 Difference]: Without dead ends: 56 [2021-09-13 14:33:21,326 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 663.63ms TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:33:21,327 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10992.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.09ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 10997.14ms IncrementalHoareTripleChecker+Time [2021-09-13 14:33:21,329 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 321 Unknown, 0 Unchecked, 3.09ms Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 73 Unchecked, 10997.14ms Time] [2021-09-13 14:33:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-09-13 14:33:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-09-13 14:33:21,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:33:21,379 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:33:21,379 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:33:21,380 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:33:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:21,381 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-09-13 14:33:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-09-13 14:33:21,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:21,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:21,382 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:33:21,382 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:33:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:21,384 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-09-13 14:33:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-09-13 14:33:21,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:21,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:21,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:33:21,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:33:21,387 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:33:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-09-13 14:33:21,388 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 20 [2021-09-13 14:33:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:33:21,389 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-09-13 14:33:21,389 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:33:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-09-13 14:33:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-13 14:33:21,390 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:33:21,390 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:33:21,406 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:33:21,597 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:33:21,597 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:33:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:33:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1264867958, now seen corresponding path program 1 times [2021-09-13 14:33:21,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:33:21,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200729089] [2021-09-13 14:33:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:33:21,598 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:33:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:33:21,599 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:33:21,600 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:33:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:21,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:33:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:21,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:33:23,222 INFO L281 TraceCheckUtils]: 0: Hoare triple {1843#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); {1843#true} is VALID [2021-09-13 14:33:23,224 INFO L281 TraceCheckUtils]: 1: Hoare triple {1843#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1851#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:33:23,224 INFO L281 TraceCheckUtils]: 2: Hoare triple {1851#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1855#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:33:23,225 INFO L281 TraceCheckUtils]: 3: Hoare triple {1855#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1859#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} is VALID [2021-09-13 14:33:23,226 INFO L281 TraceCheckUtils]: 4: Hoare triple {1859#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:33:23,227 INFO L281 TraceCheckUtils]: 5: Hoare triple {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:33:23,227 INFO L281 TraceCheckUtils]: 6: Hoare triple {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:33:23,228 INFO L281 TraceCheckUtils]: 7: Hoare triple {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:33:23,228 INFO L281 TraceCheckUtils]: 8: Hoare triple {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:33:23,230 INFO L281 TraceCheckUtils]: 9: Hoare triple {1863#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {1879#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,231 INFO L281 TraceCheckUtils]: 10: Hoare triple {1879#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !false; {1879#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,232 INFO L281 TraceCheckUtils]: 11: Hoare triple {1879#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ 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); {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,232 INFO L281 TraceCheckUtils]: 12: Hoare triple {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !false; {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,233 INFO L281 TraceCheckUtils]: 13: Hoare triple {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ 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; {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,234 INFO L281 TraceCheckUtils]: 14: Hoare triple {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ 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; {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,235 INFO L281 TraceCheckUtils]: 15: Hoare triple {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !(0bv32 == __VERIFIER_assert_~cond); {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,235 INFO L281 TraceCheckUtils]: 16: Hoare triple {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~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; {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,236 INFO L281 TraceCheckUtils]: 17: Hoare triple {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !(0bv32 == __VERIFIER_assert_~cond); {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:33:23,237 INFO L281 TraceCheckUtils]: 18: Hoare triple {1886#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ 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 (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~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; {1908#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:33:23,237 INFO L281 TraceCheckUtils]: 19: Hoare triple {1908#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1844#false} is VALID [2021-09-13 14:33:23,238 INFO L281 TraceCheckUtils]: 20: Hoare triple {1844#false} assume !false; {1844#false} is VALID [2021-09-13 14:33:23,238 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:33:23,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:33:27,523 INFO L281 TraceCheckUtils]: 20: Hoare triple {1844#false} assume !false; {1844#false} is VALID [2021-09-13 14:33:27,523 INFO L281 TraceCheckUtils]: 19: Hoare triple {1918#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1844#false} is VALID [2021-09-13 14:33:27,524 INFO L281 TraceCheckUtils]: 18: Hoare triple {1922#(= 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; {1918#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:33:27,524 INFO L281 TraceCheckUtils]: 17: Hoare triple {1922#(= 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); {1922#(= 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:33:27,524 INFO L281 TraceCheckUtils]: 16: Hoare triple {1922#(= 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; {1922#(= 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:33:27,525 INFO L281 TraceCheckUtils]: 15: Hoare triple {1922#(= 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); {1922#(= 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:33:27,525 INFO L281 TraceCheckUtils]: 14: Hoare triple {1922#(= 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; {1922#(= 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:33:27,530 INFO L281 TraceCheckUtils]: 13: Hoare triple {1922#(= 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; {1922#(= 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:33:27,530 INFO L281 TraceCheckUtils]: 12: Hoare triple {1922#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !false; {1922#(= 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:33:27,531 INFO L281 TraceCheckUtils]: 11: Hoare triple {1843#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); {1922#(= 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:33:27,531 INFO L281 TraceCheckUtils]: 10: Hoare triple {1843#true} assume !false; {1843#true} is VALID [2021-09-13 14:33:27,531 INFO L281 TraceCheckUtils]: 9: Hoare triple {1843#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); {1843#true} is VALID [2021-09-13 14:33:27,531 INFO L281 TraceCheckUtils]: 8: Hoare triple {1843#true} assume !(0bv32 == assume_abort_if_not_~cond); {1843#true} is VALID [2021-09-13 14:33:27,532 INFO L281 TraceCheckUtils]: 7: Hoare triple {1843#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; {1843#true} is VALID [2021-09-13 14:33:27,532 INFO L281 TraceCheckUtils]: 6: Hoare triple {1843#true} assume !(0bv32 == assume_abort_if_not_~cond); {1843#true} is VALID [2021-09-13 14:33:27,532 INFO L281 TraceCheckUtils]: 5: Hoare triple {1843#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; {1843#true} is VALID [2021-09-13 14:33:27,532 INFO L281 TraceCheckUtils]: 4: Hoare triple {1843#true} assume !(0bv32 == assume_abort_if_not_~cond); {1843#true} is VALID [2021-09-13 14:33:27,532 INFO L281 TraceCheckUtils]: 3: Hoare triple {1843#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1843#true} is VALID [2021-09-13 14:33:27,533 INFO L281 TraceCheckUtils]: 2: Hoare triple {1843#true} assume !(0bv32 == assume_abort_if_not_~cond); {1843#true} is VALID [2021-09-13 14:33:27,533 INFO L281 TraceCheckUtils]: 1: Hoare triple {1843#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1843#true} is VALID [2021-09-13 14:33:27,533 INFO L281 TraceCheckUtils]: 0: Hoare triple {1843#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); {1843#true} is VALID [2021-09-13 14:33:27,533 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:33:27,533 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:33:27,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200729089] [2021-09-13 14:33:27,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200729089] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:33:27,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:33:27,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 4] imperfect sequences [] total 11 [2021-09-13 14:33:27,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880462553] [2021-09-13 14:33:27,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:33:27,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:33:27,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:33:28,092 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:33:28,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 14:33:28,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:33:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 14:33:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:33:28,093 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:33:45,309 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:33:52,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:33:54,319 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:34:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:15,781 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2021-09-13 14:34:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:34:15,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:34:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:34:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:34:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2021-09-13 14:34:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:34:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2021-09-13 14:34:15,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2021-09-13 14:34:17,058 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:34:17,059 INFO L225 Difference]: With dead ends: 79 [2021-09-13 14:34:17,059 INFO L226 Difference]: Without dead ends: 77 [2021-09-13 14:34:17,060 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2395.82ms TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:34:17,061 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20382.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.13ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 20388.08ms IncrementalHoareTripleChecker+Time [2021-09-13 14:34:17,061 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 336 Unknown, 0 Unchecked, 4.13ms Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 88 Unchecked, 20388.08ms Time] [2021-09-13 14:34:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-09-13 14:34:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2021-09-13 14:34:17,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:34:17,126 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:34:17,126 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:34:17,126 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:34:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:17,128 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2021-09-13 14:34:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-09-13 14:34:17,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:17,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:17,129 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:34:17,129 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:34:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:17,131 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2021-09-13 14:34:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-09-13 14:34:17,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:17,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:17,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:34:17,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:34:17,132 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:34:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2021-09-13 14:34:17,133 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 21 [2021-09-13 14:34:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:34:17,134 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2021-09-13 14:34:17,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:34:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2021-09-13 14:34:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:34:17,135 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:34:17,135 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:34:17,146 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:34:17,336 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:34:17,337 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:34:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:34:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 94063923, now seen corresponding path program 1 times [2021-09-13 14:34:17,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:34:17,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469071410] [2021-09-13 14:34:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:34:17,338 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:34:17,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:34:17,339 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:34:17,340 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:34:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:17,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:34:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:17,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:34:19,295 INFO L281 TraceCheckUtils]: 0: Hoare triple {2333#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); {2333#true} is VALID [2021-09-13 14:34:19,297 INFO L281 TraceCheckUtils]: 1: Hoare triple {2333#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2341#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:34:19,297 INFO L281 TraceCheckUtils]: 2: Hoare triple {2341#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {2345#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,299 INFO L281 TraceCheckUtils]: 3: Hoare triple {2345#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2349#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} is VALID [2021-09-13 14:34:19,299 INFO L281 TraceCheckUtils]: 4: Hoare triple {2349#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,300 INFO L281 TraceCheckUtils]: 5: Hoare triple {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,301 INFO L281 TraceCheckUtils]: 6: Hoare triple {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,301 INFO L281 TraceCheckUtils]: 7: Hoare triple {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,302 INFO L281 TraceCheckUtils]: 8: Hoare triple {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,302 INFO L281 TraceCheckUtils]: 9: Hoare triple {2353#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,303 INFO L281 TraceCheckUtils]: 10: Hoare triple {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !false; {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,304 INFO L281 TraceCheckUtils]: 11: Hoare triple {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,305 INFO L281 TraceCheckUtils]: 12: Hoare triple {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !false; {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,305 INFO L281 TraceCheckUtils]: 13: Hoare triple {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !~bvsge64(main_~c~0, main_~b~0); {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:34:19,306 INFO L281 TraceCheckUtils]: 14: Hoare triple {2369#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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)); {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} is VALID [2021-09-13 14:34:19,307 INFO L281 TraceCheckUtils]: 15: Hoare triple {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} assume !false; {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} is VALID [2021-09-13 14:34:19,307 INFO L281 TraceCheckUtils]: 16: Hoare triple {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} 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); {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} is VALID [2021-09-13 14:34:19,308 INFO L281 TraceCheckUtils]: 17: Hoare triple {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} assume !false; {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} is VALID [2021-09-13 14:34:19,308 INFO L281 TraceCheckUtils]: 18: Hoare triple {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} 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; {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} is VALID [2021-09-13 14:34:19,309 INFO L281 TraceCheckUtils]: 19: Hoare triple {2385#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ 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)))} 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; {2401#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:34:19,309 INFO L281 TraceCheckUtils]: 20: Hoare triple {2401#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {2334#false} is VALID [2021-09-13 14:34:19,310 INFO L281 TraceCheckUtils]: 21: Hoare triple {2334#false} assume !false; {2334#false} is VALID [2021-09-13 14:34:19,310 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:34:19,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:34:36,340 INFO L281 TraceCheckUtils]: 21: Hoare triple {2334#false} assume !false; {2334#false} is VALID [2021-09-13 14:34:36,341 INFO L281 TraceCheckUtils]: 20: Hoare triple {2411#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {2334#false} is VALID [2021-09-13 14:34:36,341 INFO L281 TraceCheckUtils]: 19: Hoare triple {2415#(= (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; {2411#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:34:36,342 INFO L281 TraceCheckUtils]: 18: Hoare triple {2415#(= (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; {2415#(= (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:34:36,342 INFO L281 TraceCheckUtils]: 17: Hoare triple {2415#(= (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; {2415#(= (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:34:36,343 INFO L281 TraceCheckUtils]: 16: Hoare triple {2415#(= (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); {2415#(= (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:34:36,343 INFO L281 TraceCheckUtils]: 15: Hoare triple {2415#(= (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; {2415#(= (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:34:36,344 INFO L281 TraceCheckUtils]: 14: Hoare triple {2431#(= (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)); {2415#(= (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:34:36,344 INFO L281 TraceCheckUtils]: 13: Hoare triple {2431#(= (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); {2431#(= (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:34:36,344 INFO L281 TraceCheckUtils]: 12: Hoare triple {2431#(= (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; {2431#(= (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:34:36,345 INFO L281 TraceCheckUtils]: 11: Hoare triple {2431#(= (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); {2431#(= (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:34:36,345 INFO L281 TraceCheckUtils]: 10: Hoare triple {2431#(= (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; {2431#(= (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:34:36,346 INFO L281 TraceCheckUtils]: 9: Hoare triple {2333#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); {2431#(= (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:34:36,346 INFO L281 TraceCheckUtils]: 8: Hoare triple {2333#true} assume !(0bv32 == assume_abort_if_not_~cond); {2333#true} is VALID [2021-09-13 14:34:36,346 INFO L281 TraceCheckUtils]: 7: Hoare triple {2333#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; {2333#true} is VALID [2021-09-13 14:34:36,346 INFO L281 TraceCheckUtils]: 6: Hoare triple {2333#true} assume !(0bv32 == assume_abort_if_not_~cond); {2333#true} is VALID [2021-09-13 14:34:36,346 INFO L281 TraceCheckUtils]: 5: Hoare triple {2333#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; {2333#true} is VALID [2021-09-13 14:34:36,347 INFO L281 TraceCheckUtils]: 4: Hoare triple {2333#true} assume !(0bv32 == assume_abort_if_not_~cond); {2333#true} is VALID [2021-09-13 14:34:36,347 INFO L281 TraceCheckUtils]: 3: Hoare triple {2333#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2333#true} is VALID [2021-09-13 14:34:36,347 INFO L281 TraceCheckUtils]: 2: Hoare triple {2333#true} assume !(0bv32 == assume_abort_if_not_~cond); {2333#true} is VALID [2021-09-13 14:34:36,347 INFO L281 TraceCheckUtils]: 1: Hoare triple {2333#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2333#true} is VALID [2021-09-13 14:34:36,348 INFO L281 TraceCheckUtils]: 0: Hoare triple {2333#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); {2333#true} is VALID [2021-09-13 14:34:36,349 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:34:36,349 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:34:36,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469071410] [2021-09-13 14:34:36,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469071410] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:34:36,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:34:36,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2021-09-13 14:34:36,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437383239] [2021-09-13 14:34:36,351 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:34:36,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:34:36,351 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:34:37,336 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:34:37,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:34:37,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:34:37,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:34:37,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:34:37,337 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:35:09,967 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:35:59,434 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:36:23,152 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:37:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:23,588 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2021-09-13 14:37:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-13 14:37:23,588 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:37:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:37:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. 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:37:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 110 transitions. [2021-09-13 14:37:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. 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:37:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 110 transitions. [2021-09-13 14:37:23,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 110 transitions. [2021-09-13 14:37:31,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 108 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:37:31,370 INFO L225 Difference]: With dead ends: 121 [2021-09-13 14:37:31,370 INFO L226 Difference]: Without dead ends: 119 [2021-09-13 14:37:31,370 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 21805.04ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:37:31,371 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 184 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68933.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.64ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68954.81ms IncrementalHoareTripleChecker+Time [2021-09-13 14:37:31,371 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 0 Invalid, 529 Unknown, 0 Unchecked, 10.64ms Time], IncrementalHoareTripleChecker [36 Valid, 491 Invalid, 2 Unknown, 0 Unchecked, 68954.81ms Time] [2021-09-13 14:37:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-09-13 14:37:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2021-09-13 14:37:31,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:37:31,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 93 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 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:31,469 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 93 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 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:31,469 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 93 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 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:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:31,471 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2021-09-13 14:37:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2021-09-13 14:37:31,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:31,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:31,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 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 119 states. [2021-09-13 14:37:31,473 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 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 119 states. [2021-09-13 14:37:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:31,476 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2021-09-13 14:37:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2021-09-13 14:37:31,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:31,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:31,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:37:31,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:37:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 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:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2021-09-13 14:37:31,479 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 22 [2021-09-13 14:37:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:37:31,479 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2021-09-13 14:37:31,480 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2021-09-13 14:37:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2021-09-13 14:37:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:37:31,480 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:37:31,480 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:37:31,492 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:37:31,684 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:37:31,685 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:37:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:37:31,686 INFO L82 PathProgramCache]: Analyzing trace with hash 62520889, now seen corresponding path program 1 times [2021-09-13 14:37:31,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:37:31,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384217780] [2021-09-13 14:37:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:37:31,686 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:37:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:37:31,687 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-09-13 14:37:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:31,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:37:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:31,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:37:32,957 INFO L281 TraceCheckUtils]: 0: Hoare triple {3014#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); {3014#true} is VALID [2021-09-13 14:37:32,957 INFO L281 TraceCheckUtils]: 1: Hoare triple {3014#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3014#true} is VALID [2021-09-13 14:37:32,958 INFO L281 TraceCheckUtils]: 2: Hoare triple {3014#true} assume !(0bv32 == assume_abort_if_not_~cond); {3014#true} is VALID [2021-09-13 14:37:32,959 INFO L281 TraceCheckUtils]: 3: Hoare triple {3014#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3028#(or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} is VALID [2021-09-13 14:37:32,959 INFO L281 TraceCheckUtils]: 4: Hoare triple {3028#(or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:32,960 INFO L281 TraceCheckUtils]: 5: Hoare triple {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:32,960 INFO L281 TraceCheckUtils]: 6: Hoare triple {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:32,961 INFO L281 TraceCheckUtils]: 7: Hoare triple {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:32,961 INFO L281 TraceCheckUtils]: 8: Hoare triple {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:32,963 INFO L281 TraceCheckUtils]: 9: Hoare triple {3032#(and (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} is VALID [2021-09-13 14:37:32,963 INFO L281 TraceCheckUtils]: 10: Hoare triple {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} assume !false; {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} is VALID [2021-09-13 14:37:32,963 INFO L281 TraceCheckUtils]: 11: Hoare triple {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} is VALID [2021-09-13 14:37:32,964 INFO L281 TraceCheckUtils]: 12: Hoare triple {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} assume !false; {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))))} is VALID [2021-09-13 14:37:32,964 INFO L281 TraceCheckUtils]: 13: Hoare triple {3048#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} is VALID [2021-09-13 14:37:32,965 INFO L281 TraceCheckUtils]: 14: Hoare triple {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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; {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} is VALID [2021-09-13 14:37:32,965 INFO L281 TraceCheckUtils]: 15: Hoare triple {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} is VALID [2021-09-13 14:37:32,966 INFO L281 TraceCheckUtils]: 16: Hoare triple {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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; {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} is VALID [2021-09-13 14:37:32,966 INFO L281 TraceCheckUtils]: 17: Hoare triple {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} is VALID [2021-09-13 14:37:32,967 INFO L281 TraceCheckUtils]: 18: Hoare triple {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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; {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} is VALID [2021-09-13 14:37:32,967 INFO L281 TraceCheckUtils]: 19: Hoare triple {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} is VALID [2021-09-13 14:37:32,968 INFO L281 TraceCheckUtils]: 20: Hoare triple {3061#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == ~bvmul64(main_~b~0, main_~d~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3083#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:37:32,968 INFO L281 TraceCheckUtils]: 21: Hoare triple {3083#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {3015#false} is VALID [2021-09-13 14:37:32,968 INFO L281 TraceCheckUtils]: 22: Hoare triple {3015#false} assume !false; {3015#false} is VALID [2021-09-13 14:37:32,969 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:32,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:37:35,693 INFO L281 TraceCheckUtils]: 22: Hoare triple {3015#false} assume !false; {3015#false} is VALID [2021-09-13 14:37:35,693 INFO L281 TraceCheckUtils]: 21: Hoare triple {3093#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {3015#false} is VALID [2021-09-13 14:37:35,694 INFO L281 TraceCheckUtils]: 20: Hoare triple {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == ~bvmul64(main_~b~0, main_~d~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3093#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:37:35,694 INFO L281 TraceCheckUtils]: 19: Hoare triple {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:37:35,694 INFO L281 TraceCheckUtils]: 18: Hoare triple {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~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; {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:37:35,695 INFO L281 TraceCheckUtils]: 17: Hoare triple {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:37:35,695 INFO L281 TraceCheckUtils]: 16: Hoare triple {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~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; {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:37:35,696 INFO L281 TraceCheckUtils]: 15: Hoare triple {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:37:35,696 INFO L281 TraceCheckUtils]: 14: Hoare triple {3097#(= (bvmul 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 == ~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; {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:37:35,696 INFO L281 TraceCheckUtils]: 13: Hoare triple {3014#true} 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; {3097#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:37:35,696 INFO L281 TraceCheckUtils]: 12: Hoare triple {3014#true} assume !false; {3014#true} is VALID [2021-09-13 14:37:35,696 INFO L281 TraceCheckUtils]: 11: Hoare triple {3014#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); {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 10: Hoare triple {3014#true} assume !false; {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 9: Hoare triple {3014#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); {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 8: Hoare triple {3014#true} assume !(0bv32 == assume_abort_if_not_~cond); {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 7: Hoare triple {3014#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; {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 6: Hoare triple {3014#true} assume !(0bv32 == assume_abort_if_not_~cond); {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 5: Hoare triple {3014#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; {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 4: Hoare triple {3014#true} assume !(0bv32 == assume_abort_if_not_~cond); {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 3: Hoare triple {3014#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3014#true} is VALID [2021-09-13 14:37:35,697 INFO L281 TraceCheckUtils]: 2: Hoare triple {3014#true} assume !(0bv32 == assume_abort_if_not_~cond); {3014#true} is VALID [2021-09-13 14:37:35,698 INFO L281 TraceCheckUtils]: 1: Hoare triple {3014#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3014#true} is VALID [2021-09-13 14:37:35,698 INFO L281 TraceCheckUtils]: 0: Hoare triple {3014#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); {3014#true} is VALID [2021-09-13 14:37:35,698 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,698 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:37:35,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384217780] [2021-09-13 14:37:35,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384217780] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:37:35,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:37:35,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2021-09-13 14:37:35,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485422702] [2021-09-13 14:37:35,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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 23 [2021-09-13 14:37:35,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:37:35,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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:37:36,403 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:37:36,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:37:36,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:37:36,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:37:36,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:37:36,404 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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:37:43,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:37:47,994 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:37:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:53,678 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2021-09-13 14:37:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:37:53,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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 23 [2021-09-13 14:37:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:37:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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:37:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2021-09-13 14:37:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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:37:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2021-09-13 14:37:53,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2021-09-13 14:37:54,984 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:37:54,986 INFO L225 Difference]: With dead ends: 125 [2021-09-13 14:37:54,986 INFO L226 Difference]: Without dead ends: 123 [2021-09-13 14:37:54,986 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1905.98ms TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:37:54,987 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8005.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.69ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 8007.20ms IncrementalHoareTripleChecker+Time [2021-09-13 14:37:54,987 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 1.69ms Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 42 Unchecked, 8007.20ms Time] [2021-09-13 14:37:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-09-13 14:37:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2021-09-13 14:37:55,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:37:55,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 117 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 116 states have internal predecessors, (141), 0 states have call successors, (0), 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,157 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 117 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 116 states have internal predecessors, (141), 0 states have call successors, (0), 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,158 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 117 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 116 states have internal predecessors, (141), 0 states have call successors, (0), 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,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:55,160 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2021-09-13 14:37:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2021-09-13 14:37:55,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:55,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:55,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 116 states have internal predecessors, (141), 0 states have call successors, (0), 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 123 states. [2021-09-13 14:37:55,161 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 116 states have internal predecessors, (141), 0 states have call successors, (0), 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 123 states. [2021-09-13 14:37:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:55,164 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2021-09-13 14:37:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2021-09-13 14:37:55,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:55,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:55,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:37:55,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:37:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 116 states have internal predecessors, (141), 0 states have call successors, (0), 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,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2021-09-13 14:37:55,168 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 23 [2021-09-13 14:37:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:37:55,169 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2021-09-13 14:37:55,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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:37:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2021-09-13 14:37:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 14:37:55,170 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:37:55,170 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:37:55,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-09-13 14:37:55,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:37:55,391 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:37:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:37:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash 201274102, now seen corresponding path program 1 times [2021-09-13 14:37:55,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:37:55,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614612720] [2021-09-13 14:37:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:37:55,392 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:37:55,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:37:55,393 INFO L229 MonitoredProcess]: Starting monitored process 10 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:55,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-09-13 14:37:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:55,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2021-09-13 14:37:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:55,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:37:57,867 INFO L281 TraceCheckUtils]: 0: Hoare triple {3745#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); {3745#true} is VALID [2021-09-13 14:37:57,868 INFO L281 TraceCheckUtils]: 1: Hoare triple {3745#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3753#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} is VALID [2021-09-13 14:37:57,870 INFO L281 TraceCheckUtils]: 2: Hoare triple {3753#(or (and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (and (or (not (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {3757#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:57,871 INFO L281 TraceCheckUtils]: 3: Hoare triple {3757#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3761#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} is VALID [2021-09-13 14:37:57,872 INFO L281 TraceCheckUtils]: 4: Hoare triple {3761#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (or (and (or (not (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32))) (not (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:57,873 INFO L281 TraceCheckUtils]: 5: Hoare triple {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:57,873 INFO L281 TraceCheckUtils]: 6: Hoare triple {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:57,873 INFO L281 TraceCheckUtils]: 7: Hoare triple {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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; {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:57,874 INFO L281 TraceCheckUtils]: 8: Hoare triple {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))} is VALID [2021-09-13 14:37:57,878 INFO L281 TraceCheckUtils]: 9: Hoare triple {3765#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 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); {3781#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:37:57,878 INFO L281 TraceCheckUtils]: 10: Hoare triple {3781#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !false; {3781#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:37:57,879 INFO L281 TraceCheckUtils]: 11: Hoare triple {3781#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 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) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~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); {3788#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~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)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:37:57,879 INFO L281 TraceCheckUtils]: 12: Hoare triple {3788#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~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)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !false; {3788#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~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)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:37:57,880 INFO L281 TraceCheckUtils]: 13: Hoare triple {3788#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~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)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !~bvsge64(main_~c~0, main_~b~0); {3788#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~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)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:37:57,881 INFO L281 TraceCheckUtils]: 14: Hoare triple {3788#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~c~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)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~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)); {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:37:57,881 INFO L281 TraceCheckUtils]: 15: Hoare triple {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} assume !false; {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:37:57,882 INFO L281 TraceCheckUtils]: 16: Hoare triple {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 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); {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:37:57,882 INFO L281 TraceCheckUtils]: 17: Hoare triple {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} assume !false; {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:37:57,883 INFO L281 TraceCheckUtils]: 18: Hoare triple {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 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; {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:37:57,883 INFO L281 TraceCheckUtils]: 19: Hoare triple {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 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; {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:37:57,884 INFO L281 TraceCheckUtils]: 20: Hoare triple {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} assume !(0bv32 == __VERIFIER_assert_~cond); {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:37:57,886 INFO L281 TraceCheckUtils]: 21: Hoare triple {3798#(and (bvsle ULTIMATE.start_main_~x~0 (_ bv50 32)) (bvsle ULTIMATE.start_main_~y~0 (_ bv50 32)) (= (bvadd ((_ sign_extend 32) (_ bv0 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) (_ bv0 32))))) ULTIMATE.start_main_~s~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)) (= ULTIMATE.start_main_~q~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvneg (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 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; {3820#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:37:57,886 INFO L281 TraceCheckUtils]: 22: Hoare triple {3820#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {3746#false} is VALID [2021-09-13 14:37:57,886 INFO L281 TraceCheckUtils]: 23: Hoare triple {3746#false} assume !false; {3746#false} is VALID [2021-09-13 14:37:57,887 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:37:57,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:38:51,986 INFO L281 TraceCheckUtils]: 23: Hoare triple {3746#false} assume !false; {3746#false} is VALID [2021-09-13 14:38:51,987 INFO L281 TraceCheckUtils]: 22: Hoare triple {3830#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {3746#false} is VALID [2021-09-13 14:38:51,987 INFO L281 TraceCheckUtils]: 21: Hoare triple {3834#(= (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; {3830#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:38:51,987 INFO L281 TraceCheckUtils]: 20: Hoare triple {3834#(= (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); {3834#(= (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:51,988 INFO L281 TraceCheckUtils]: 19: Hoare triple {3834#(= (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; {3834#(= (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:51,988 INFO L281 TraceCheckUtils]: 18: Hoare triple {3834#(= (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; {3834#(= (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:51,988 INFO L281 TraceCheckUtils]: 17: Hoare triple {3834#(= (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; {3834#(= (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:51,989 INFO L281 TraceCheckUtils]: 16: Hoare triple {3834#(= (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); {3834#(= (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:51,989 INFO L281 TraceCheckUtils]: 15: Hoare triple {3834#(= (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; {3834#(= (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:54,085 INFO L281 TraceCheckUtils]: 14: Hoare triple {3856#(= ULTIMATE.start_main_~c~0 (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0))) (bvmul (bvneg (bvmul ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0)) ((_ sign_extend 32) 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 := ~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)); {3834#(= (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 UNKNOWN [2021-09-13 14:38:54,086 INFO L281 TraceCheckUtils]: 13: Hoare triple {3856#(= ULTIMATE.start_main_~c~0 (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0))) (bvmul (bvneg (bvmul ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))))} assume !~bvsge64(main_~c~0, main_~b~0); {3856#(= ULTIMATE.start_main_~c~0 (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0))) (bvmul (bvneg (bvmul ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:38:54,086 INFO L281 TraceCheckUtils]: 12: Hoare triple {3856#(= ULTIMATE.start_main_~c~0 (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0))) (bvmul (bvneg (bvmul ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))))} assume !false; {3856#(= ULTIMATE.start_main_~c~0 (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0))) (bvmul (bvneg (bvmul ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:38:54,087 INFO L281 TraceCheckUtils]: 11: Hoare triple {3866#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~x~0) (bvneg (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) (_ bv0 32))))) (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ((_ sign_extend 32) (_ bv0 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); {3856#(= ULTIMATE.start_main_~c~0 (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0))) (bvmul (bvneg (bvmul ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:38:54,087 INFO L281 TraceCheckUtils]: 10: Hoare triple {3866#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~x~0) (bvneg (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) (_ bv0 32))))) (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ((_ sign_extend 32) (_ bv0 32)))))))} assume !false; {3866#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~x~0) (bvneg (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) (_ bv0 32))))) (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:38:54,088 INFO L281 TraceCheckUtils]: 9: Hoare triple {3745#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); {3866#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~x~0) (bvneg (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) (_ bv0 32))))) (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)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) (bvneg (bvmul ULTIMATE.start_main_~s~0 ((_ sign_extend 32) (_ bv0 32)))))))} is VALID [2021-09-13 14:38:54,088 INFO L281 TraceCheckUtils]: 8: Hoare triple {3745#true} assume !(0bv32 == assume_abort_if_not_~cond); {3745#true} is VALID [2021-09-13 14:38:54,088 INFO L281 TraceCheckUtils]: 7: Hoare triple {3745#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; {3745#true} is VALID [2021-09-13 14:38:54,088 INFO L281 TraceCheckUtils]: 6: Hoare triple {3745#true} assume !(0bv32 == assume_abort_if_not_~cond); {3745#true} is VALID [2021-09-13 14:38:54,088 INFO L281 TraceCheckUtils]: 5: Hoare triple {3745#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; {3745#true} is VALID [2021-09-13 14:38:54,088 INFO L281 TraceCheckUtils]: 4: Hoare triple {3745#true} assume !(0bv32 == assume_abort_if_not_~cond); {3745#true} is VALID [2021-09-13 14:38:54,089 INFO L281 TraceCheckUtils]: 3: Hoare triple {3745#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3745#true} is VALID [2021-09-13 14:38:54,089 INFO L281 TraceCheckUtils]: 2: Hoare triple {3745#true} assume !(0bv32 == assume_abort_if_not_~cond); {3745#true} is VALID [2021-09-13 14:38:54,089 INFO L281 TraceCheckUtils]: 1: Hoare triple {3745#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, 50bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3745#true} is VALID [2021-09-13 14:38:54,089 INFO L281 TraceCheckUtils]: 0: Hoare triple {3745#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); {3745#true} is VALID [2021-09-13 14:38:54,089 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:54,089 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:38:54,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614612720] [2021-09-13 14:38:54,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614612720] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:38:54,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:38:54,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2021-09-13 14:38:54,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233450690] [2021-09-13 14:38:54,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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:38:54,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:38:54,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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:57,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:57,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:38:57,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:38:57,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:38:57,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=140, Unknown=5, NotChecked=0, Total=182 [2021-09-13 14:38:57,726 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 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:39:01,138 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-09-13 14:39:04,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:39:08,178 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:39:14,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:39:18,902 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:39:27,988 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:39:37,171 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:40:03,986 WARN L210 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 49 [2021-09-13 14:40:26,894 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:40:50,684 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:40:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:40:50,770 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 76429.51ms TimeCoverageRelationStatistics Valid=105, Invalid=351, Unknown=6, NotChecked=0, Total=462 [2021-09-13 14:40:50,771 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39546.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.88ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39838.04ms IncrementalHoareTripleChecker+Time [2021-09-13 14:40:50,771 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 189 Unknown, 0 Unchecked, 2.88ms Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 5 Unknown, 0 Unchecked, 39838.04ms Time] [2021-09-13 14:40:50,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-09-13 14:40:50,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:40:50,973 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@7fdf402a 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:40:50,976 INFO L158 Benchmark]: Toolchain (without parser) took 610701.96ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 45.9MB in the beginning and 33.9MB in the end (delta: 12.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2021-09-13 14:40:50,976 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 46.3MB in the beginning and 46.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:40:50,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.85ms. Allocated memory is still 65.0MB. Free memory was 45.8MB in the beginning and 34.2MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:40:50,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.42ms. Allocated memory is still 65.0MB. Free memory was 34.2MB in the beginning and 47.8MB in the end (delta: -13.6MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2021-09-13 14:40:50,977 INFO L158 Benchmark]: Boogie Preprocessor took 34.77ms. Allocated memory is still 65.0MB. Free memory was 47.8MB in the beginning and 46.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:40:50,977 INFO L158 Benchmark]: RCFGBuilder took 4403.40ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 34.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:40:50,977 INFO L158 Benchmark]: TraceAbstraction took 605985.73ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 34.3MB in the beginning and 33.9MB in the end (delta: 363.6kB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2021-09-13 14:40:50,979 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.17ms. Allocated memory is still 65.0MB. Free memory was 46.3MB in the beginning and 46.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.85ms. Allocated memory is still 65.0MB. Free memory was 45.8MB in the beginning and 34.2MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.42ms. Allocated memory is still 65.0MB. Free memory was 34.2MB in the beginning and 47.8MB in the end (delta: -13.6MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.77ms. Allocated memory is still 65.0MB. Free memory was 47.8MB in the beginning and 46.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 4403.40ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 34.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 605985.73ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 34.3MB in the beginning and 33.9MB in the end (delta: 363.6kB). Peak memory consumption was 19.6MB. 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@7fdf402a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7fdf402a: 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:40:51,075 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...